On randomly Hamiltonian graphs

DOI10.1007/BF01425231zbMATH Open0233.05121OpenAlexW2062046042MaRDI QIDQ2551111FDOQ2551111

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)

Cites Work

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

Cited In (8)

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

This page was built for publication: On randomly Hamiltonian graphs

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