Long paths and large cycles in finite graphs
From MaRDI portal
Publication:3333075
DOI10.1002/jgt.3190080209zbMath0544.05044OpenAlexW2121034169MaRDI QIDQ3333075
Publication date: 1984
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190080209
Related Items (18)
Longest paths joining given vertices in a graph ⋮ Stability in the Erdős-Gallai theorems on cycles and paths ⋮ Extremal 3-connected graphs ⋮ Long cycles passing through a linear forest ⋮ A degree sum condition for long cycles passing through a linear forest ⋮ A Dirac theorem for trestles ⋮ Monophonic convexity in weighted graphs ⋮ Stability in the Erdős-Gallai theorem on cycles and paths. II ⋮ A generalization of Menger's theorem ⋮ On a generalization of a theorem of Nash-Williams ⋮ A new result about panconnectivity on graphs ⋮ Fan-type theorem for long cycles containing a specified edge ⋮ Long paths and cycles passing through specified vertices under the average degree condition ⋮ Some degree bounds for the circumference of graphs ⋮ On 2-connected hypergraphs with no long cycles ⋮ Long cycles through a linear forest ⋮ A generalization of Dirac's theorem ⋮ On the circumference of 3-connected graphs
This page was built for publication: Long paths and large cycles in finite graphs
