One or two disjoint circuits cover independent edges. Lovász-Woodall conjecture
From MaRDI portal
(Redirected from Publication:1850574)
Recommendations
Cites work
- scientific article; zbMATH DE number 3758364 (Why is no real title available?)
- scientific article; zbMATH DE number 16299 (Why is no real title available?)
- A nine point theorem for 3-connected graphs
- Any four independent edges of a 4-connected graph are contained in a circuit
- Circuits containing specified edges
- Circuits through specified edges
- Cycles Through Prescribed and Forbidden Point Sets
- Cycles intersecting a prescribed vertex set
- Cycles through a prescribed vertex set in \(n\)-connected graphs.
- Cycles through specified vertices of a graph
- In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
- Note on circuits containing specified edges
- On circuits through five edges
- One or two disjoint circuits cover independent edges. Lovász-Woodall conjecture
- The binding number of a graph and its Anderson number
Cited in
(10)- 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
- A note on disjoint dijoins
- 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)
