Name
Abstract | ||
|---|---|---|
A seminal theorem of Tutte states that 4-connected planar graphs are Hamiltonian. Applying a result of Thomas and Yu, one can show that every 4-connected graph with crossing number 1 is Hamiltonian. In this paper, we continue along this path and prove the titular statement. We also discuss the traceability and Hamiltonicity of 3-connected graphs with small crossing number and few 3-cuts, and present applications of our results. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1137/17M1138443 | SIAM JOURNAL ON DISCRETE MATHEMATICS |
Keywords | Field | DocType |
Hamiltonian cycle,crossing number,3-cuts | Graph,Discrete mathematics,Combinatorics,Crossing number (graph theory),Hamiltonian (quantum mechanics),Hamiltonian path,Connectivity,Mathematics,Planar graph | Journal |
Volume | Issue | ISSN |
32 | 4 | 0895-4801 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kenta Ozeki | 1 | 138 | 36.31 |
| Carol T. Zamfirescu | 2 | 38 | 15.25 |