Edge-colouring seven-regular planar graphs

DOI10.1016/j.jctb.2014.11.005zbMath1319.05051arXiv1210.7349OpenAlexW1891427623MaRDI QIDQ491000

Ken-ichi Kawarabayashi, Katherine Edwards, Maria Chudnovsky, P. D. Seymour

Publication date: 21 August 2015

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1210.7349

zbMATH Keywords

planar graphedge colouringfour-colour theoremdischargingreducible configuration

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items

A survey on flows in graphs and matroids, Packing six \(T\)-joins in plane graphs, Homomorphisms of partial \(t\)-trees and edge-colorings of partial 3-trees, Graph edge coloring: a survey, Edge-colouring eight-regular planar graphs, Homomorphism bounds and edge-colourings of \(K_{4}\)-minor-free graphs

Cites Work

• Edge-colouring eight-regular planar graphs
• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• The four-colour theorem