scientific article; zbMATH DE number 3512156

Cited in

(26)

Sparse Hamiltonian 2-decompositions together with exact count of numerous Hamilton cycles
The number of Hamiltonian circuits
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
Hamiltonicity in locally finite graphs: two extensions and a counterexample
Hamilton cycles in infinite cubic graphs
Long cycles in Hamiltonian graphs
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
On 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
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
On vertex-transitive graphs with a unique Hamiltonian cycle
Chords in longest cycles
Another Hamiltonian cycle in bipartite Pfaffian graphs
On the girth and connectivity of cubic graphs with a unique longest cycle
Uniquely Hamiltonian graphs for many sets of degrees
Every 2-connected [4,2]-graph of order at least seven contains a pancyclic edge
Symmetry classes 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)