A new proof of Seymour's 6-flow theorem

Journal of Combinatorial Theory, Series B - Tập 122 - Trang 187-195 - 2017
Matt DeVos1, Edita Rollová2, Robert Šámal3
1Math Dept., Simon Fraser University, Burnaby, British Columbia, Canada
2European Centre of Excellence, NTIS – New Technologies for Information Society, Faculty of Applied Sciences, University of West Bohemia, Pilsen, Czech Republic
3Computer Science Institute of Charles University, Prague, Czech Republic

Tài liệu tham khảo

Diestel, 2010, Graph Theory, vol. 173 Jaeger, 1992, Group connectivity of graphs—a nonhomogeneous analogue of nowhere-zero flow properties, J. Combin. Theory Ser. B, 56, 165, 10.1016/0095-8956(92)90016-Q Lovász, 2013, Nowhere-zero 3-flows and modulo k-orientations, J. Combin. Theory Ser. B, 103, 587, 10.1016/j.jctb.2013.06.003 Seymour, 1981, Nowhere-zero 6-flows, J. Combin. Theory Ser. B, 30, 130, 10.1016/0095-8956(81)90058-7 Tutte, 1954, A contribution to the theory of chromatic polynomials, Canad. J. Math., 6, 80, 10.4153/CJM-1954-010-9 Zhang, 1997, Integer Flows and Cycle Covers of Graphs, vol. 205