$K_2$-Hamiltonian Graphs: I
From MaRDI portal
Publication:5009329
DOI10.1137/20M1355252zbMath1475.05103OpenAlexW3185786130MaRDI QIDQ5009329
Publication date: 20 August 2021
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/20m1355252
Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Eulerian and Hamiltonian graphs (05C45) Graph operations (line graphs, products, etc.) (05C76)
Related Items (3)
On a conjecture of Grünbaum on longest cycles ⋮ On the hamiltonicity of a planar graph and its vertex‐deleted subgraphs ⋮ K2‐Hamiltonian graphs: II
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Infinite families of 2-hypohamiltonian/2-hypotraceable oriented graphs
- Non-Hamiltonian cubic planar maps
- Locally Hamiltonian graphs
- Smallest maximally nonhamiltonian graphs
- Planar and infinite hypohamiltonian and hypotraceable graphs
- Planar cubic hypohamiltonian and hypotraceable graphs
- 4-connected projective planar graphs are Hamiltonian
- Hypohamiltonian and hypotraceable graphs
- Vertices of small degree in uniquely Hamiltonian graphs
- Polyhedra with few 3-cuts are Hamiltonian
- Gallai's question and constructions of almost hypotraceable graphs
- Shortness coefficient of cyclically 4-edge-connected cubic graphs
- Every generalized Petersen graph has a Tait coloring
- Vertices missed by longest paths or circuits
- Planar Hypohamiltonian Graphs on 40 Vertices
- Leaf-Critical and Leaf-Stable Graphs
- A Theorem on Planar Graphs
- The crossing numbers of some generalized Petersen graphs.
- Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
- On longest paths and circuits in graphs.
- Infinitely many planar cubic hypohamiltonian graphs of girth 5
- New constructions of hypohamiltonian and hypotraceable graphs
- On Hamilton cycles in certain planar graphs
- Decompositions and reductions of snarks
- On Hypohamiltonian and Almost Hypohamiltonian Graphs
- Über die Nichtexistenz eines Knotenpunktes, durch den alle längsten Wege eines Graphen gehen
- Variations on the Hamiltonian Theme
- Flip-Flops in Hypohamiltonian Graphs
- Self-dual configurations and regular graphs
- On factorisation of graphs
- Transversals of longest paths
- On the hamiltonicity of a planar graph and its vertex‐deleted subgraphs
This page was built for publication: $K_2$-Hamiltonian Graphs: I
