Mkrtchyan, Vahan V.


Petersen graph conjecture

Author(s): Mkrtchyan; Petrosyan

\begin{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. \end{conjecture}

Keywords:

Syndicate content