Long cycles through a linear forest

DOI10.1006/jctb.2000.2022zbMath1026.05065OpenAlexW2071072049MaRDI QIDQ1850534

Bing Wei, Feng Tian, Zhi-quan Hu

Publication date: 10 December 2002

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

Full work available at URL: https://semanticscholar.org/paper/8551c05509a0a92d33d6c0ad573bafb704b949f5

zbMATH Keywords

cyclematchingpath

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items (7)

Circumferences of k-connected graphs involving independence numbers ⋮ On a cycle through a specified linear forest of a graph ⋮ Long cycles passing through a linear forest ⋮ The formula for Turán number of spanning linear forests ⋮ Extensions to 2-factors in bipartite graphs ⋮ A degree sum condition for long cycles passing through a linear forest ⋮ Weighted degrees and heavy cycles in weighted graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a conjecture of Bondy
• Cycles and paths through specified vertices in k-connected graphs
• Circuits through specified edges
• Long paths and large cycles in finite graphs

This page was built for publication: Long cycles through a linear forest