On a cycle through a specified linear forest of a graph

DOI10.1016/j.disc.2005.11.043zbMath1114.05052OpenAlexW2019434459MaRDI QIDQ868359

Tobias Gerlach, Jochen Harant

Publication date: 2 March 2007

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2005.11.043

zbMATH Keywords

cycleconnectivitytoughness

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Connectivity (05C40)

Related Items (2)

A degree condition for cycles passing through specified vertices and edges ⋮ Hamiltonian cycles through prescribed edges of 4-connected maximal planar graphs

Cites Work

• Unnamed Item
• Circuits through specified edges
• Circuits containing specified edges
• Cycles through subsets with large degree sums
• Long cycles through a linear forest
• One or two disjoint circuits cover independent edges. Lovász-Woodall conjecture
• On paths and cycles through specified vertices
• Menger's Theorem
• In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
• Cycles and Connectivity in Graphs

This page was built for publication: On a cycle through a specified linear forest of a graph