One or two disjoint circuits cover independent edges. Lovász-Woodall conjecture

DOI10.1006/jctb.2001.2059zbMath1023.05085OpenAlexW2091441627MaRDI QIDQ1850574

Ken-ichi Kawarabayashi

Publication date: 10 December 2002

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

Full work available at URL: https://doi.org/10.1006/jctb.2001.2059

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40)

Related Items (8)

On a cycle through a specified linear forest of a graph ⋮ An Improved Algorithm for Finding Cycles Through Elements ⋮ Cycle traversability for claw-free graphs and polyhedral maps ⋮ Cycles through a prescribed vertex set in \(n\)-connected graphs. ⋮ M-alternating Hamilton paths and \(M\)-alternating Hamilton cycles ⋮ Clique or hole in claw-free graphs ⋮ One or two disjoint circuits cover independent edges. Lovász-Woodall conjecture ⋮ Rooted topological minors on four vertices

Cites Work

• Unnamed Item
• Unnamed Item
• Any four independent edges of a 4-connected graph are contained in a circuit
• On circuits through five edges
• A nine point theorem for 3-connected graphs
• Circuits through specified edges
• Cycles through specified vertices of a graph
• Circuits containing specified edges
• Note on circuits containing specified edges
• Cycles through a prescribed vertex set in \(n\)-connected graphs.
• One or two disjoint circuits cover independent edges. Lovász-Woodall conjecture
• In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
• Cycles Through Prescribed and Forbidden Point Sets
• Cycles intersecting a prescribed vertex set
• The binding number of a graph and its Anderson number

This page was built for publication: One or two disjoint circuits cover independent edges. Lovász-Woodall conjecture