Home » Subject » Graph Theory » Basic G.T. » Matchings
Importance: Low ✭
Author(s): Mkrtchyan, Vahan V.
Petrosyan, Samvel S.
Subject: Graph Theory
» Basic Graph Theory
» » Matchings
Keywords:
Recomm. for undergrads: yes
Posted by: vahanmkrtchyan2002
on: November 24th, 2007
Solved by:
Conjecture   Let G be a connected bridgeless cubic graph any 2-factor of which is comprised of cycles of the length five. Then G is the Petersen graph.

1 comment

Reply

Comments are limited to a maximum of 1000 characters.
More information about formatting options