Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

Graphs where every maximal path is maximum

From MaRDI portal
Publication:1924151
Jump to:navigation, search

DOI10.1006/JCTB.1996.0048zbMath0860.05062OpenAlexW2094475111MaRDI QIDQ1924151

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


zbMATH Keywords

characterizationHamiltonian pathpath of maximal length


Mathematics Subject Classification ID

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


Related Items (4)

Path spectra for trees ⋮ Greedily constructing Hamiltonian paths, Hamiltonian cycles and maximum linear forests ⋮ Unnamed Item ⋮ Non‐path spectrum sets







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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1924151&oldid=14348899"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 1 February 2024, at 14:59.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki