Union of perfect matchings in bridgeless cubic graphs - MathOverflow
It's known that every cubic bridgeless graph has 1-factor (Petersen). But Does anybody know, how to prove that for every edge in a cubic bridgeless graph there exists a 1-factor, which contains it?
Union of perfect matchings in bridgeless cubic graphs - MathOverflow Union of perfect matchings in bridgeless cubic graphs Ask Question Asked 12 years, 8 months ago Modified 12 years, 8 months ago Viewed 350 times 0 $\begingroup$ It's known that every cubic bridgeless graph has 1-factor ( Petersen ). But Does anybody know, how to prove that for every edge in a cubic bridgeless graph there exists a 1-factor, which contains it? Because I found articles, where this is stated, but no proof of it so far (for example this one - theorem 2.1.) Thanks in advance graph-theory Share Cite Improve this que
Explore this link on the map →related reading
- Cubic graph - Wikipediaen.wikipedia.org
- nullstellensatzweb.math.princeton.edu
- Bridge (graph theory) - Wikipediaen.wikipedia.org
- parity edge coloringmilans.us
- Complete graph - Wikipediaen.wikipedia.org
- Matchstick graph - Wikipediaen.wikipedia.org
- [2309.10122] Graph Threadingarxiv.org
- Eulerian path - Wikipediaen.wikipedia.org
- claude-cycles.dviwww-cs-faculty.stanford.edu
- Exact Stability for Turan's Theoremarxiv.org
- piercing intervals - gyarfasarxiv.org
- Efficient Detection of Exchangeable Factors in Factor Graphsarxiv.org