scientific article; zbMATH DE number 3512156

zbMATH Open0327.05116MaRDI QIDQ4091987FDOQ4091987

Authors: J. Sheehan 

Publication date: 1975

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Cited In (21)

• Regular graphs with few longest cycles
• Chords in longest cycles
• Counting Hamiltonian cycles on quartic 4-vertex-connected planar graphs
• The number of Hamiltonian circuits
• Chords of longest cycles in cubic graphs
• Independent dominating sets and a second hamiltonian cycle in regular graphs
• Improved asymptotic upper bounds for the minimum number of longest cycles in regular graphs
• On sparse hamiltonian 2-decompositions together with exact count of numerous Hamilton cycles
• Few Hamiltonian cycles in graphs with one or two vertex degrees
• Graphs with few Hamiltonian cycles
• On Sheehan's Conjecture for Graphs with Symmetry
• On uniquely Hamiltonian claw-free and triangle-free graphs
• Approximate and randomized algorithms for computing a second Hamiltonian cycle
• Hamiltonicity in locally finite graphs: two extensions and a counterexample
• Hamilton cycles in infinite cubic graphs
• Vertices of small degree in uniquely Hamiltonian graphs
• Long cycles in Hamiltonian graphs
• On vertex-transitive graphs with a unique Hamiltonian cycle
• Sparse Hamiltonian 2-decompositions together with exact count of numerous Hamilton cycles
• On the minimum number of Hamiltonian cycles in regular graphs
• \(4\)-regular \(4\)-connected Hamiltonian graphs with a bounded number of Hamiltonian cycles

This page was built for publication:

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