Scenic graphs. I: Traceable graphs

MaRDI QIDQ2713606zbMATH OpenFDO

Authors Michael Jacobson, André E. Kézdy, Jeno Lehel

Publication date 10 June 2001

Published in Ars Combinatoria (Search for Journal in Brave)

zbMATH Keywords

Hamiltonian path

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Review text

\textit{C. Thomassen} [J. Reine Angew. Math. 268/269, 271-282 (1974; Zbl 0273.05121)] characterized ``graphs in which every path is contained in a Hamilton path. In the present article a new proof of Thomassen's theorem is given. The characterization distinguishes dozen or so cases and the proof is complicated.NEWLINENEWLINENEWLINEFor Part II of the present paper see [Australas. J. Comb. 19, 287-307 (1999; Zbl 0929.05048)].

Recommendations

• scientific article; zbMATH DE number 1334643
• The Hamiltonian problem and \(t\)-path traceable graphs
• Graphs where every maximal path is maximum
• scientific article; zbMATH DE number 4099351
• scientific article; zbMATH DE number 3972890

Cited in

(5)

• Graphs where every maximal path is maximum
• Non‐path spectrum sets
• scientific article; zbMATH DE number 1334643 (Why is no real title available?)
• Endpoint extendable paths in dense graphs
• Path spectra for trees

This page was built for publication: Scenic graphs. I: Traceable graphs

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