An equivalent version of the 3-flow conjecture

被引:60
作者
Kochol, M
机构
[1] Suché Mýto 19, 811 03
关键词
nowhere-zero 3-and Z(3)-flow; circular flow;
D O I
10.1006/jctb.2001.2054
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
The 3-flow conjecture or Tutte is that every bridgeless graph without a 3-edge cut has a nowhere-zero 3-flow. We show that it suffices to prove this conjecture for 5-edge-connected graphs. (C) 2001 Academic Press.
引用
收藏
页码:258 / 261
页数:4
相关论文
共 10 条
[1]  
[Anonymous], 1988, Selected Topics in Graph Theory
[2]   GROUP CONNECTIVITY OF GRAPHS - A NONHOMOGENEOUS ANALOG OF NOWHERE-ZERO FLOW PROPERTIES [J].
JAEGER, F ;
LINIAL, N ;
PAYAN, C ;
TARSI, M .
JOURNAL OF COMBINATORIAL THEORY SERIES B, 1992, 56 (02) :165-182
[3]  
Jaeger F., 1984, North-Holland, V37, P391
[4]  
Kochol M, 1998, J GRAPH THEOR, V28, P1, DOI 10.1002/(SICI)1097-0118(199805)28:1<1::AID-JGT1>3.0.CO
[5]  
2-Q
[6]  
KOCHOL M, 2000, 20 MATH I SLOV AC SC
[7]  
KOCHOL M, 2000, 18 MATH I SLOV AC SC
[8]  
SAYMOUR PD, 1995, HDB COMBINATORICS, P289
[9]  
Tutte W.T., 1950, P LOND MATH SOC, V51, P474
[10]  
ZHANG CQ, 1997, INTEGRAL FLOWS CYCLE