Smallest counterexample to the 5-flow conjecture has girth at least eleven
暂无分享,去创建一个
[1] Jonathan L. Gross,et al. Topological Graph Theory , 1987, Handbook of Graph Theory.
[2] Martin Kochol,et al. Snarks without Small Cycles , 1996, J. Comb. Theory, Ser. B.
[3] Martin Kochol,et al. Counting nowhere-zero flows on wheels , 2008, Discret. Math..
[4] R. Isaacs. Infinite Families of Nontrivial Trivalent Graphs Which are not Tait Colorable , 1975 .
[5] W. T. Tutte. A Class Of Abelian Groups , 1956, Canadian Journal of Mathematics.
[6] Martin Kochol. A cyclically 6-edge-connected snark of order 118 , 1996, Discret. Math..
[7] Martin Kochol,et al. Superposition and Constructions of Graphs Without Nowhere-zero k-flows , 2002, Eur. J. Comb..
[8] Martin Kochol,et al. Reduction of the 5-Flow Conjecture to cyclically 6-edge-connected snarks , 2004, J. Comb. Theory, Ser. B.
[9] Martin Kochol,et al. Restrictions On Smallest Counterexamples To The 5-Flow Conjecture , 2006, Comb..
[10] Martin Kochol,et al. Decomposition formulas for the flow polynomial , 2005, Eur. J. Comb..
[11] W. T. Tutte,et al. A Contribution to the Theory of Chromatic Polynomials , 1954, Canadian Journal of Mathematics.
[12] L. Beineke,et al. Selected Topics in Graph Theory 2 , 1985 .