Hamiltonicity of planar graphs with a forbidden minor.

JOURNAL OF GRAPH THEORY(2019)

引用 1|浏览8
暂无评分
摘要
Tutte showed that 4-connected planar graphs are Hamiltonian, but it is well known that 3-connected planar graphs need not be Hamiltonian. We show that K2,5-minor-free 3-connected planar graphs are Hamiltonian. This does not extend to K2,5-minor-free 3-connected graphs in general, as shown by the Petersen graph, and does not extend to K2,6-minor-free 3-connected planar graphs, as we show by an infinite family of examples.
更多
查看译文
关键词
forbidden minor,hamilton cycle,planar graph
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要