Exercises Videos Notes Multiple-choice questions

Related books

Graph Coloring Problems Introduction to Graph Theory Matching Theory Modern Graph Theory Chromatic Graph Theory Graph Theory Suggest a Book
0

Petersen’s theorem

Level: unknown
 

posted Jul 28 '12

kintali gravatar image Shiva Kintali flag of United States
691 ● 1 ● 6 ● 21
http://www.cs.princeton.e...

Prove that every 2-edge-connected 3-regular graph has a perfect matching

Source: from book "Matching Theory"
Printable version LaTeX source
delete flag offensive retag edit

Stats

Posted: Jul 28 '12

Seen: 93 times

Last updated: Jul 29 '12

Related exercises

Properties of Petersen Graph

Minimum edge cover vs Maximum matching

Perfect Matchings in Cubic Graphs

Minimum Flip Connectivity Problem

Edge connectivity vs Strong connectivity

Connectivity of cubic graphs

Cycle in k-connected graphs

Matching saturating high degree vertices

Unmatchable edges of bipartite graphs

Finding perfect matching in bipartite graphs

Related videos

Graceful Tree Conjecture

Copyright TrueShelf, 2012. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.
about | faq