State Tutte’s theorem concerning graphs having a \(1\)-factor.
Prove that every connected, bridgeless, \(3\)-regular graph has a \(1\)-factor.
Find a connected \(3\)-regular graph with no \(1\)-factor.
Tutte's theorem and 1-factors in cubic bridgeless graphs
P-UNL852970-06A5
- Area
- Topology
- Seen at
- UNL
- Years
- 2006
- Status
- draft