Edge-colouring seven-regular planar graphs

DOI10.1016/J.JCTB.2014.11.005MaRDI QIDQ491000zbMATH OpenOpenAlexFDO

Authors Maria Chudnovsky, Katherine Edwards, Ken-ichi Kawarabayashi, Paul 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

dischargingedge colouringfour-colour theoremplanar graphreducible configuration

Mathematics Subject Classification ID

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

Abstract: A conjecture due to the fourth author states that every $d$-regular planar multigraph can be $d$-edge-coloured, provided that for every odd set $X$ of vertices, there are at least $d$ edges between $X$ and its complement. For $d=3$ this is the four-colour theorem, and the conjecture has been proved for all $dle8$, by various authors. In particular, two of us proved it when $d=7$; and then three of us proved it when $d=8$. The methods used for the latter give a proof in the $d=7$ case that is simpler than the original, and we present it here.

Recommendations

• Edge-colouring eight-regular planar graphs
• A seven-color theorem on edge-face coloring of plane graphs
• Planar graphs of maximum degree seven are Class I
• scientific article; zbMATH DE number 3970775
• Edge-colouring of regular graphs of large degree

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

Cited in

(6)

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

This page was built for publication: Edge-colouring seven-regular planar graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q491000)