首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   3篇
  免费   0篇
管理学   1篇
社会学   2篇
  2016年   1篇
  2013年   1篇
  2006年   1篇
排序方式: 共有3条查询结果,搜索用时 0 毫秒
1
1.
2.
3.
Let \(\mathcal{B}\) denote the class of all 3-connected cubic bipartite plane graphs. A conjecture of Barnette states that every graph in \(\mathcal{B}\) has a Hamilton cycle. A cyclic sequence of big faces is a cyclic sequence of different faces, each bounded by at least six edges, such that two faces from the sequence are adjacent if and only if they are consecutive in the sequence. Suppose that \({F_1, F_2, F_3}\) is a proper 3-coloring of the faces of \(G^*\in \mathcal{B}\). We prove that if every cyclic sequence of big faces of \(G^*\) has a face belonging to \(F_1\) and a face belonging to \(F_2\), then \(G^*\) has the following properties: \(H^{+-}\): If any two edges are chosen on the same face, then there is a Hamilton cycle through one and avoiding the other, \(H^{--}\): If any two edges are chosen which are an even distance apart on the same face, then there is a Hamilton cycle that avoids both. Moreover, let \(X\) and \(Y\) partition the set of big faces of \(G^*\) such that all such faces of \(F_1\) are in \(X\) and all such faces of \(F_2\) are in \(Y\). We prove that if every cyclic sequence of big faces has a face belonging to \(X\) and a face belonging to \(Y\), then \(G^*\) has a Hamilton cycle.  相似文献   
1
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号