On the hamiltonicity of a planar graph and its vertex‐deleted subgraphs
From MaRDI portal
Publication:6093144
DOI10.1002/JGT.22864zbMath1528.05039MaRDI QIDQ6093144
Publication date: 5 October 2023
Published in: Journal of Graph Theory (Search for Journal in Brave)
Related Items (4)
Regular Graphs with Few Longest Cycles ⋮ Non-Hamiltonian graphs in which every edge-contracted subgraph is Hamiltonian ⋮ Vertex degrees and 2-cuts in graphs with many Hamiltonian vertex-deleted subgraphs ⋮ $K_2$-Hamiltonian Graphs: I
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On non-traceable, non-hypotraceable, arachnoid graphs
- Generation and properties of snarks
- Hamiltonian properties of polyhedra with few 3-cuts. A survey
- Infinite families of 2-hypohamiltonian/2-hypotraceable oriented graphs
- Locally Hamiltonian graphs
- Planar and infinite hypohamiltonian and hypotraceable graphs
- Planar cubic hypohamiltonian and hypotraceable graphs
- 4-connected projective planar graphs are Hamiltonian
- Vertices of small degree in uniquely Hamiltonian graphs
- Polyhedra with few 3-cuts are Hamiltonian
- Gallai's question and constructions of almost hypotraceable graphs
- Cycles in 4-connected planar graphs
- 4-connected polyhedra have at least a linear number of Hamiltonian cycles
- Vertices missed by longest paths or circuits
- Non-Hamiltonian graphs in which every edge-contracted subgraph is Hamiltonian
- Planar Hypohamiltonian Graphs on 40 Vertices
- Leaf-Critical and Leaf-Stable Graphs
- A Theorem on Planar Graphs
- Cycles in digraphs– a survey
- Hamiltonian Cycles and Uniquely Edge Colourable Graphs
- Every 4-Connected Graph with Crossing Number 2 is Hamiltonian
- New constructions of hypohamiltonian and hypotraceable graphs
- Hamilton cycles in plane triangulations
- On Hamilton cycles in certain planar graphs
- Cubic vertices in planar hypohamiltonian graphs
- $K_2$-Hamiltonian Graphs: I
- On Hypohamiltonian and Almost Hypohamiltonian Graphs
- Hamiltonian circuits on 3-polytopes
- A theorem on paths in planar graphs
- A theorem on paths in planar graphs
This page was built for publication: On the hamiltonicity of a planar graph and its vertex‐deleted subgraphs
