Every line graph of a 4-edge-connected graph is I-connected
暂无分享,去创建一个
[1] Cun-Quan Zhang. Integer Flows and Cycle Covers of Graphs , 1997 .
[2] Hong-Jian Lai,et al. Nowhere zero flows in line graphs , 2001, Discret. Math..
[3] Nathan Linial,et al. Group connectivity of graphs - A nonhomogeneous analogue of nowhere-zero flow properties , 1992, J. Comb. Theory, Ser. B.
[4] J. A. Bondy,et al. Graph Theory with Applications , 1978 .
[5] Martin Kochol. An Equivalent Version of the 3-Flow Conjecture , 2001, J. Comb. Theory, Ser. B.
[6] Hong-Jian Lai. Nowhere-zero 3-flows in locally connected graphs , 2003, J. Graph Theory.
[7] Hong-Jian Lai. Group Connectivity of 3-Edge-Connected Chordal Graphs , 2000, Graphs Comb..
[8] L. Beineke,et al. Selected Topics in Graph Theory 2 , 1985 .
[9] W. T. Tutte,et al. A Contribution to the Theory of Chromatic Polynomials , 1954, Canadian Journal of Mathematics.