Criticality of counterexamples to toroidal edge-Hamiltonicity
From MaRDI portal
Publication:5964979
DOI10.1007/s00373-015-1542-5zbMath1331.05126arXiv1312.1379OpenAlexW2048153908WikidataQ125024816 ScholiaQ125024816MaRDI QIDQ5964979
Emily A. Marshall, Mark N. Ellingham
Publication date: 2 March 2016
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1312.1379
Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Cites Work
- Unnamed Item
- Unnamed Item
- Bridges and Hamiltonian circuits in planar graphs
- 4-connected projective planar graphs are Hamiltonian
- Five-connected toroidal graphs are Hamiltonian
- A theorem on graphs
- Hamiltonian cycles in bipartite toroidal graphs with a partite set of degree four vertices
- Hamilton paths in toroidal graphs
- Hamiltonian circuits in some maps on the torus
- Hamiltonian cycles in bipartite quadrangulations on the torus
- A Theorem on Planar Graphs
- Hamiltonicity of 5‐Connected Toroidal Triangulations
- Polytopes, graphs, and complexes
- 4-connected projective-planar graphs are hamiltonian-connected
- Tilings of the Torus and the Klein Bottle and Vertex-Transitive Graphs on a Fixed Surface
- A theorem on paths in planar graphs
- A theorem on paths in planar graphs
