Abstract
In 1913, Birkhoff proved that the smallest counterexample to the Four Color Theorem must be an internally 6-connected planar graph. We use methods of linear algebra for an alternative proof of this statement.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Appel K, Haken W (1989) Every planar map is four colorable. In: Contemporary mathematics, vol 98. American Mathematical Society, Providence, RI
Birkhoff GD (1913) The reducibility of maps. Am J Math 35:115–128
Diestel R (1997) Graph theory. Springer, New York
Fleischner H (1976) Eine gemeinsame Basis für die Theorie der eulerschen Graphen und den Satz von Petersen. Monatsh Math 81:267–278
Kochol M (2002) Superposition and constructions of graphs without nowhere-zero k-flows. Eur J Combin 23:281–306
Kochol M (2004) Reduction of the 5-flow conjecture to cyclically 6-edge-connected snarks. J Comb Theory B 90:139–145
Kochol M (2005) Decomposition formulas for the flow polynomial. Eur J Comb 26:1086–1093
Tait PG (1880) Remarks on the colouring of maps. Proc R Soc Edinb 10:729
Tutte WT (1954) A contribution to the theory of chromatic polynomials. Can J Math 6:80–91
Tutte WT (1956) A class of Abelian groups. Can J Math 8:13–28
Zhang C-Q (1997) Integral flows and cycle covers of graphs. Marcel Dekker, New York
Acknowledgments
The research was partially supported by grant VEGA 2/0118/10.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Kochol, M. Linear algebraic approach to an edge-coloring result. J Comb Optim 28, 341–347 (2014). https://doi.org/10.1007/s10878-012-9561-0
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-012-9561-0