The equivalence of two conjectures of Berge and Fulkerson
The equivalence of two conjectures of Berge and Fulkerson
复制标题
DOI：
10.1002/jgt.20545
复制
发表时间：
2011-10
影响因子：
0.9
通讯作者：
G. Mazzuoccolo
中科院分区：
文献类型：
--
作者：
G. Mazzuoccolo
设G是无桥三次图。Fulkerson证明存在G的六个1-因子，使得G的每条边恰好包含在其中的两个中。Berge证明了G的边集最多可以被5个1因子覆盖。我们证明了这两个定理是等价的。© 2010 Wiley Periodicals，Inc. J Graph Theory 68：125 - 128，2011
Let G be a bridgeless cubic graph. Fulkerson conjectured that there exist six 1‐factors of G such that each edge of G is contained in exactly two of them. Berge conjectured that the edge‐set of G can be covered with at most five 1‐factors. We prove that the two conjectures are equivalent. © 2010 Wiley Periodicals, Inc. J Graph Theory 68:125‐128, 2011