A note on Hamiltonian cycles in planar graphs

被引：0
|
作者：
Kreh, Martin [1 ]
机构：
[1] Univ Hildesheim, Inst Math & Appl Comp Sci, Samelson pl 1, D-31141 Hildesheim, Germany
来源：
DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS | 2023年 / 15卷 / 01期
关键词：
Hamiltonian cycle; planar graph; Diophantine equation;
D O I：
10.1142/S1793830922500604
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
Unlike the problem of finding Eulerian cycles, the problem of deciding whether a given graph has a Hamiltonian cycle is NP-complete, even when restricting to planar graphs. There are however some criteria that. can be used in special cases. One of them can be derived by Grinberg's theorem. In this note, we give some more (slightly more general) criteria derived from Grinberg's theorem to show that a graph does not have a Hamiltonian cycle.
引用
收藏
页数：5
相关论文
共 50 条
12345