- Homework Statement
- Does there exist a cubic graph with three bridges that contains a 1-factor?
- Homework Equations
- ##k_0 (G-S) \leq |S|
I understand how to show a given graph does/does not contain a 1-factor but I'm not sure how to show existence (or the lack thereof). Please advise.