论文信息 - 4-Connected Projective-Planar Graphs Are Hamiltonian

4-Connected Projective-Planar Graphs Are Hamiltonian

We prove the result stated in the title (conjectured by Grunbaum) and a conjecture of Plummer that every graph which can be obtained from a 4-connected planar graph by deleting two vertices is Hamiltonian. The proofs are constructive and give rise to polynomial-time algorithms.

Xingxing Yu | Robin Thomas | Xingxing Yu | R. Thomas

[1] W. T. Tutte. A THEOREM ON PLANAR GRAPHS , 1956 .

[2] H. Whitney. A Theorem on Graphs , 1931 .

[3] Norishige Chiba,et al. A theorem on paths in planar graphs , 1986 .

[4] Carsten Thomassen,et al. A theorem on paths in planar graphs , 1983, J. Graph Theory.

[5] B. Grünbaum. Polytopes, graphs, and complexes , 1970 .