Colouring problems

DOI10.1007/BF03023063zbMath0402.05028OpenAlexW3189857526MaRDI QIDQ1255499

William T. Tutte

Publication date: 1978

Published in: The Mathematical Intelligencer (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf03023063

zbMATH Keywords

Colouring ProblemsFour Colour Theorem

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

Graph \(r\)-hued colorings -- a survey, What does logic have to tell us about mathematical proofs?, Some snarks are worse than others, On Tutte's extension of the four-colour problem, Hajos' graph-coloring conjecture: Variations and counterexamples, On the conjecture of Hajos

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bemerkungen zu Hadwigers Vermutung
• Nonexistence of six-dimensional tangential 2-block
• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• Beweis einer Abschwächung der Hadwiger-Vermutung
• Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
• An attempt to understand the four color problem
• A digest of the four color theorem
• On the algebraic theory of graph colorings
• Polyhedral decompositions of cubic graphs
• Network-Colourings
• On the Imbedding of Linear Graphs in Surfaces