2-edge-Hamiltonian-connectedness of 4-connected plane graphs
From MaRDI portal
Publication:2509769
DOI10.1016/j.ejc.2013.06.033zbMath1296.05116OpenAlexW2084948670MaRDI QIDQ2509769
Publication date: 29 July 2014
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2013.06.033
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)
Related Items
Computing Tutte Paths, Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a survey, Hamiltonian properties of polyhedra with few 3-cuts. A survey, Hamiltonian-connectedness of triangulations with few separating triangles
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Scattering number and extremal non-Hamiltonian graphs
- Connectivity, genus, and the number of components in vertex-deleted subgraphs
- On a class of posets and the corresponding comparability graphs
- 4-connected projective planar graphs are Hamiltonian
- Five-connected toroidal graphs are Hamiltonian
- Measuring the vulnerability for classes of intersection graphs
- Hypohamiltonian and hypotraceable graphs
- 4-connected projective-planar graphs are Hamiltonian-connected
- Hamilton paths in toroidal graphs
- Graphs with 1-hamiltonian-connected cubes
- Tough graphs and Hamiltonian circuits.
- Thomassen's conjecture implies polynomiality of 1-Hamilton-connectedness in line graphs
- Disjoint paths, planarizing cycles, and spanning walks
- A Theorem on Planar Graphs
- MinimumK-hamiltonian graphs
- The 2-hamiltonian cubes of graphs
- Minimumk-hamiltonian graphs, II
- The Planar Hamiltonian Circuit Problem is NP-Complete
- On Hamilton cycles in certain planar graphs
- An Infinite Class of Hypohamiltonian Graphs
- Polytopes, graphs, and complexes
- A theorem on paths in planar graphs
