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

Journal of Combinatorial Theory. Series B

Volumn 84, Issue 1, 2002, Pages 1-44

  Kawarabayashi, Ken Ichi ^a,b  

^a KEIO UNIVERSITY   (Japan)

^b VANDERBILT UNIVERSITY   (United States)

Author keywords

Circuit; Independent edges; Lov sz conjecture

Indexed keywords

EID: 0036170713     PISSN: 00958956     EISSN: None     Source Type: Journal    
DOI: 10.1006/jctb.2001.2059     Document Type: Article

References (19)

1. "Graphs and Hypergraphs"
2. Cycles through specified vertices of a graph
3. In abstrakten Graphen vorhandene vollständige 4-Graphen und ihre Unterteilungen
4. Any four independent edges of a 4-connected graph are contained in a circuit
5. Circuits through specified edges
6. Cycles through prescribed and forbidden point sets
7. A nine point theorem for 3-connected graphs
8. Cycles intersecting a prescribed vertex set
9. Cycles through prescribed elements in a graph
10. Problem 5
11. Exercise 6.67, "Combinatorial Problems and Exercises"
12. On circuits through five edges
13. Note on circuits containing specified edges
14. Circuits containing specified edges
15. The binding number of a graph and its Anderson number