Structural and computational results on platypus graphs

DOI10.1016/j.amc.2020.125491zbMath1462.05110arXiv1712.05158OpenAlexW3038272282MaRDI QIDQ2656702

Addie Neyt, Jan Goedgebeur, Carol T. Zamfirescu

Publication date: 16 March 2021

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1712.05158

zbMATH Keywords

computationscubic graphgirthtraceablenon-Hamiltonianhypotraceablehypohamiltonianmaximally non-Hamiltonian graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

Vertex degrees and 2-cuts in graphs with many Hamiltonian vertex-deleted subgraphs

Uses Software

• nauty
• Traces
• plantri
• GenHypohamiltonian

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generation and properties of snarks
• Infinitely many hypohamiltonian cubic graphs of girth 7
• The classification of Hamiltonian generalized Petersen graphs
• The smallest non-Hamiltonian 3-connected cubic planar graphs have 38 vertices
• Smallest maximally nonhamiltonian graphs
• House of Graphs: a database of interesting graphs
• Practical graph isomorphism. II.
• Construction of planar triangulations with minimum degree 5
• Component connectivity of generalized Petersen graphs
• On hypohamiltonian snarks and a theorem of Fiorini
• Improved bounds for hypohamiltonian graphs
• On Non‐Hamiltonian Graphs for which every Vertex‐Deleted Subgraph Is Traceable
• A theorem on tait colorings with an application to the generalized Petersen graphs
• Variations on the Hamiltonian Theme
• I-graphs and the corresponding configurations
• Self-dual configurations and regular graphs

This page was built for publication: Structural and computational results on platypus graphs