Uniquely Hamiltonian graphs of minimum degree 4

DOI10.1002/JGT.21729MaRDI QIDQ2874097zbMATH OpenOpenAlexFDO

Authors 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

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

Cites work

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

Cited in

(17)

• Circuit double covers in special types of cubic graphs
• A note on using the resistance-distance matrix to solve Hamiltonian cycle problem
• Long cycles in Hamiltonian graphs
• Complete symmetry breaking constraints for the class of uniquely Hamiltonian graphs
• A lower bound for the smallest uniquely Hamiltonian planar graph with minimum degree three
• Counting Hamiltonian cycles on quartic 4-vertex-connected planar graphs
• On uniquely Hamiltonian claw-free and triangle-free graphs
• On Sheehan's Conjecture for Graphs with Symmetry
• Finding Hamiltonian cycle in graphs of bounded treewidth. Experimental evaluation
• Regular graphs with few longest cycles
• Graphs with few Hamiltonian cycles
• Improved asymptotic upper bounds for the minimum number of longest cycles in regular graphs
• Few Hamiltonian cycles in graphs with one or two vertex degrees
• Approximate and randomized algorithms for computing a second Hamiltonian cycle
• Perfect pseudo-matchings in cubic graphs
• Uniquely Hamiltonian graphs for many sets of degrees
• Symmetry classes of Hamiltonian cycles

This page was built for publication: Uniquely Hamiltonian graphs of minimum degree 4

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2874097)