Linear algebraic approach to an edge-coloring result

Martin Kochol ()
Additional contact information
Martin Kochol: MÚ SAV

Journal of Combinatorial Optimization, 2014, vol. 28, issue 2, No 2, 347 pages

Abstract: 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.

Keywords: Nowhere-zero $$\mathbb{Z }_2\times \mathbb{Z }_2$$ -flow; Graph duality; Planar graph; Simple 5-cut snark; Internally 6-connected graph; Partition (search for similar items in EconPapers)
Date: 2014
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-012-9561-0 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:28:y:2014:i:2:d:10.1007_s10878-012-9561-0

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-012-9561-0

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().