A (<5)-Colour Theorem for Planar Graphs

DOI10.1112/blms/5.3.302zbMath0278.05103OpenAlexW2054651287MaRDI QIDQ4405185

S. H. Scott, Anthony J. W. Hilton, Richard Rado

Publication date: 1973

Published in: Bulletin of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/blms/5.3.302

Mathematics Subject Classification ID

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

Related Items (23)

The \(k\)-fractal of a simplicial complex ⋮ Multiple list colouring of planar graphs ⋮ The complexity of multicolouring ⋮ BCH codes and distance multi- or fractional colorings in hypercubes asymptotically ⋮ Every planar graph is 1-defective \((9,2)\)-paintable ⋮ On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs ⋮ Fractional coloring of triangle-free planar graphs ⋮ Planar graphs without 4- and 6-cycles are (7 : 2)-colorable ⋮ Circular coloring and fractional coloring in planar graphs ⋮ Fractional coloring planar graphs under Steinberg-type conditions ⋮ Exact and Parameterized Algorithms for (k, i)-Coloring ⋮ Independent sets in triangle-free cubic planar graphs ⋮ Multicolorings, measures and games on graphs ⋮ Set colourings of graphs. (Reprint) ⋮ Planar graphs are \(9/2\)-colorable ⋮ Set colourings of graphs ⋮ Fractional Coloring Methods with Applications to Degenerate Graphs and Graphs on Surfaces ⋮ Subcubic triangle-free graphs have fractional chromatic number at most 14/5 ⋮ Planar graphs without cycles of length 4 or 5 are \((11 : 3)\)-colorable ⋮ NP-completeness of a family of graph-colouring problems ⋮ The fractional chromatic number, the Hall ratio, and the lexicographic product ⋮ On the fractional chromatic number and the lexicographic product of graphs ⋮ A Three and Five Color Theorem

This page was built for publication: A (<5)-Colour Theorem for Planar Graphs