Petrosyan, Samvel S.


Petersen graph conjecture

Author(s): Mkrtchyan; Petrosyan

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.

Keywords:

Syndicate content