Uniquely Hamiltonian Graphs of Minimum Degree 4

DOI10.1002/jgt.21729zbMath1280.05074OpenAlexW1564921898MaRDI QIDQ2874097

Herbert Fleischner

Publication date: 28 January 2014

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.21729

zbMATH Keywords

Hamiltonian graphsuniquely Hamiltonian graphs

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Vertex degrees (05C07)

Related Items (11)

Complete symmetry breaking constraints for the class of uniquely Hamiltonian graphs ⋮ Regular Graphs with Few Longest Cycles ⋮ A lower bound for the smallest uniquely Hamiltonian planar graph with minimum degree three ⋮ On Sheehan's Conjecture for Graphs with Symmetry ⋮ A note on using the resistance-distance matrix to solve Hamiltonian cycle problem ⋮ Long cycles in Hamiltonian graphs ⋮ Graphs with few hamiltonian cycles ⋮ Counting Hamiltonian cycles on quartic 4-vertex-connected planar graphs ⋮ Finding Hamiltonian Cycle in Graphs of Bounded Treewidth ⋮ Circuit double covers in special types of cubic graphs ⋮ On uniquely Hamiltonian claw-free and triangle-free graphs

Cites Work

• Graphs uniquely Hamiltonian-connected from a vertex
• A degree constraint for uniquely Hamiltonian graphs
• The size of graphs uniquely Hamiltonian-connected from a vertex
• Spanning cycles of nearly cubic graphs
• Independent dominating sets and a second hamiltonian cycle in regular graphs
• Chords of longest cycles in cubic graphs
• Vertices of small degree in uniquely Hamiltonian graphs
• Forbidden subgraphs of graphs uniquely Hamiltonian-connected from a vertex
• On the structure of graphs uniquely hamiltonian-connected from a vertex
• On the Number of Hamiltonian Cycles in Bipartite Graphs
• A Theorem on Planar Graphs
• Independent dominating sets and hamiltonian cycles
• On the number of Hamiltonian cycles in triangulations
• On the number of hamiltonian cycles in a maximal planar graph
• Hamiltonian Cycles and Uniquely Edge Colourable Graphs
• Uniqueness of maximal dominating cycles in 3‐regular graphs and of hamiltonian cycles in 4‐regular graphs
• On Hamiltonian Circuits

This page was built for publication: Uniquely Hamiltonian Graphs of Minimum Degree 4