On randomly Hamiltonian graphs

DOI10.1007/BF01425231zbMath0233.05121OpenAlexW2062046042MaRDI QIDQ2551111

Carsten Thomassen

Publication date: 1973

Published in: Mathematische Annalen (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/162353

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Eulerian and Hamiltonian graphs (05C45)

Related Items (8)

Greedily constructing Hamiltonian paths, Hamiltonian cycles and maximum linear forests ⋮ On Path-amenable Graphs ⋮ \(\alpha\)-extendable paths in infinite graphs ⋮ Path coverings of the vertices of a tree ⋮ On separating cycles in graphs ⋮ Greedily constructing maximal partial \(f\)-factors ⋮ Graphs in which every finite path is contained in a circuit ⋮ Unnamed Item

Cites Work

• On a special class of hamiltonian graphs
• Randomly Traceable Graphs
• On Arbitrarily Traceable Graphs.

This page was built for publication: On randomly Hamiltonian graphs