科研之友
微信
新浪微博
Facebook
分享链接
摘要
Barnette conjectured that all cubic 3-connected plane graphs with maximum face size at most 6 are hamiltonian. We provide a method of construction of a hamiltonian cycle in an arbitrary 3-connected cubic plane graph possessing a face f (of arbitrary size) such that every face incident with f is bounded by at most five edges and any other face is bounded by at most six edges. The method works for a larger family of graphs where many faces may have arbitrary sizes.
- 出版日期2018
