Linear forests and ordered cycles

DOI10.7151/dmgt.1236zbMath1060.05054OpenAlexW2085970062MaRDI QIDQ4668422

Ronald J. Gould, Linda Lesniak, Michael S. Jacobson, Florian Pfender, Ralph J. Faudree, Guantao Chen

Publication date: 19 April 2005

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1236

zbMATH Keywords

Hamilton cyclesgraph linkages

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items (9)

Subdivision extendibility ⋮ Extensions to 2-factors in bipartite graphs ⋮ Recent advances on the Hamiltonian problem: survey III ⋮ On the 1-fault Hamiltonicity for graphs satisfying Ore's theorem ⋮ Linkedness and Ordered Cycles in Digraphs ⋮ \(k\)-Ordered Hamilton cycles in digraphs ⋮ Iterated line graphs are maximally ordered ⋮ Distributing vertices on Hamiltonian cycles ⋮ A look at cycles containing specified elements of a graph

This page was built for publication: Linear forests and ordered cycles