共 50 条
CYCLE COVERS OF GRAPHS WITH A NOWHERE-ZERO 4-FLOW
被引:4
|作者:
RASPAUD, A
机构:
[1] La.B.R.I., Université Bordeaux I, Talence, 33405, 351, Cours De La Libération
关键词:
D O I:
10.1002/jgt.3190150608
中图分类号:
O1 [数学];
学科分类号:
0701 ;
070101 ;
摘要:
It is shown that the edges of a simple graph with a nowhere-zero 4-flow can be covered with cycles such that the sum of the lengths of the cycles is at most \E(G)\ + \V(G)\ - 3. This solves a conjecture proposed by G. Fan.
引用
收藏
页码:649 / 654
页数:6
相关论文