Graphs where every maximal path is maximum

DOI10.1006/JCTB.1996.0048zbMATH Open0860.05062OpenAlexW2094475111MaRDI QIDQ1924151FDOQ1924151

Authors: Michael Tarsi 

Publication date: 21 April 1997

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1996.0048

Recommendations

• Graphs maximal with respect to absence of hamiltonian paths
• Greedily constructing Hamiltonian paths, Hamiltonian cycles and maximum linear forests
• Scenic graphs. I: Traceable graphs
• scientific article; zbMATH DE number 1334643

zbMATH Keywords

Hamiltonian pathcharacterizationpath of maximal length

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38) Structural characterization of families of graphs (05C75)

Cited In (5)

• Non‐path spectrum sets
• Path spectra for trees
• Greedily constructing Hamiltonian paths, Hamiltonian cycles and maximum linear forests
• Lower bounds on the odds against tree spectral sets
• Scenic graphs. I: Traceable graphs

This page was built for publication: Graphs where every maximal path is maximum

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