One or two disjoint circuits cover independent edges. Lovász-Woodall conjecture
From MaRDI portal
Publication:1850574
DOI10.1006/JCTB.2001.2059zbMATH Open1023.05085OpenAlexW2091441627MaRDI QIDQ1850574FDOQ1850574
Authors: 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
Recommendations
Cites Work
- Title not available (Why is that?)
- A nine point theorem for 3-connected graphs
- The binding number of a graph and its Anderson number
- Circuits through specified edges
- In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
- Any four independent edges of a 4-connected graph are contained in a circuit
- Circuits containing specified edges
- One or two disjoint circuits cover independent edges. Lovász-Woodall conjecture
- Cycles through specified vertices of a graph
- Cycles through a prescribed vertex set in \(n\)-connected graphs.
- Cycles Through Prescribed and Forbidden Point Sets
- Cycles intersecting a prescribed vertex set
- On circuits through five edges
- Note on circuits containing specified edges
- Title not available (Why is that?)
Cited In (9)
- Rooted topological minors on four vertices
- Cycle traversability for claw-free graphs and polyhedral maps
- On a cycle through a specified linear forest of a graph
- An Improved Algorithm for Finding Cycles Through Elements
- M-alternating Hamilton paths and \(M\)-alternating Hamilton cycles
- Clique or hole in claw-free graphs
- Any four independent edges of a 4-connected graph are contained in a circuit
- One or two disjoint circuits cover independent edges. Lovász-Woodall conjecture
- Cycles through a prescribed vertex set in \(n\)-connected graphs.
This page was built for publication: One or two disjoint circuits cover independent edges. Lovász-Woodall conjecture
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1850574)
