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

DOI10.1515/CRLL.1974.268-269.271MaRDI QIDQ5181726zbMATH OpenOpenAlexFDO

Authors 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, https://eudml.org/doc/151468

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Cited in

(9)

• Non‐path spectrum sets
• Endpoint extendable paths in dense graphs
• Graph theory (algorithmic, algebraic, and metric problems)
• Path spectra for trees
• On separating cycles in graphs
• Path coverings of the vertices of a tree
• Spanning trees with pairwise nonadjacent endvertices
• scientific article; zbMATH DE number 4068925 (Why is no real title available?)
• Greedily constructing Hamiltonian paths, Hamiltonian cycles and maximum linear forests

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

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