Skip to main content

New answers tagged

2 votes

The perfect matching problem of planar graph

You don't even need that whole 4-block tree stuff; you can read the result directly by contracting the `rest' into vertices. More details: As in the above proof, fix a set $T$ that minimizes $odd(T)-|...
Therese Biedl's user avatar

Top 50 recent answers are included