Home » Subject » Graph Theory
Importance: Medium ✭✭
Author(s):
Subject: Graph Theory
Keywords:
Recomm. for undergrads: no
Posted by: Gagik
on: January 15th, 2010
Conjecture   If in a bridgeless cubic graph $ G $ the cycles of any $ 2 $-factor are odd, then $ \omega(G)\leq 2 $, where $ \omega(G) $ denotes the oddness of the graph $ G $, that is, the minimum number of odd cycles in a $ 2 $-factor of $ G $.

4 comments

Reply

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