Graphs in which every path is contained in a Hamilton path.

DOI10.1515/crll.1974.268-269.271zbMath0273.05121OpenAlexW4254599845MaRDI QIDQ5181726

Carsten Thomassen

Publication date: 1974

Published in: Journal für die reine und angewandte Mathematik (Crelles Journal) (Search for Journal in Brave)

Full work available at URL: https://www.digizeitschriften.de/dms/resolveppn/?PPN=GDZPPN002189437

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (9)

Spanning trees with pairwise nonadjacent endvertices ⋮ Path spectra for trees ⋮ Greedily constructing Hamiltonian paths, Hamiltonian cycles and maximum linear forests ⋮ Endpoint extendable paths in dense graphs ⋮ Graph theory (algorithmic, algebraic, and metric problems) ⋮ Path coverings of the vertices of a tree ⋮ On separating cycles in graphs ⋮ Non‐path spectrum sets ⋮ Unnamed Item

This page was built for publication: Graphs in which every path is contained in a Hamilton path.