Non-Hamiltonian graphs in which every edge-contracted subgraph is Hamiltonian
From MaRDI portal
Publication:2662552
DOI10.1016/j.amc.2020.125714zbMath1462.05206OpenAlexW3093684337MaRDI QIDQ2662552
Carol T. Zamfirescu, Tomáš Madaras, Igor Fabrici, Mária Timková, Nicolas Van Cleemput
Publication date: 14 April 2021
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://biblio.ugent.be/publication/8689531
Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)
Related Items (2)
On the hamiltonicity of a planar graph and its vertex‐deleted subgraphs ⋮ Vertex degrees and 2-cuts in graphs with many Hamiltonian vertex-deleted subgraphs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On non-traceable, non-hypotraceable, arachnoid graphs
- Planar and infinite hypohamiltonian and hypotraceable graphs
- Planar cubic hypohamiltonian and hypotraceable graphs
- Polyhedra with few 3-cuts are Hamiltonian
- House of Graphs: a database of interesting graphs
- On hypohamiltonian graphs
- Practical graph isomorphism. II.
- Planar Hypohamiltonian Graphs on 40 Vertices
- Leaf-Critical and Leaf-Stable Graphs
- On planar hypohamiltonian graphs
- A Theorem on Planar Graphs
- Systematic searches for hypohamiltonian graphs
- Fast generation of regular graphs and construction of cages
- Every graph occurs as an induced subgraph of some hypohamiltonian graph
- Improved bounds for hypohamiltonian graphs
- Cubic vertices in planar hypohamiltonian graphs
- On almost hypohamiltonian graphs
- On Hypohamiltonian and Almost Hypohamiltonian Graphs
- On Non‐Hamiltonian Graphs for which every Vertex‐Deleted Subgraph Is Traceable
- Variations on the Hamiltonian Theme
- Flip-Flops in Hypohamiltonian Graphs
- On the hamiltonicity of a planar graph and its vertex‐deleted subgraphs
This page was built for publication: Non-Hamiltonian graphs in which every edge-contracted subgraph is Hamiltonian
