Scenic graphs. I: Traceable graphs (Q2713606)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Scenic graphs. I: Traceable graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Scenic graphs. I: Traceable graphs |
scientific article |
Statements
10 June 2001
0 references
Hamiltonian path
0 references
Scenic graphs. I: Traceable graphs (English)
0 references
\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)].
0 references
