Kempe-locking configurations

DOI10.3390/math6120309zbMath1425.05063OpenAlexW2898775370WikidataQ128768013 ScholiaQ128768013MaRDI QIDQ2337272

James A. Tilley

Publication date: 19 November 2019

Published in: Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/math6120309

zbMATH Keywords

graph coloringKempe chainBirkhoff diamondKempe-locking

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Uses Software

• plantri

Cites Work

• Unnamed Item
• Unnamed Item
• The \(a\)-graph coloring problem
• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• The four-colour theorem
• Using Kempe exchanges to disentangle Kempe chains
• Construction of planar triangulations with minimum degree 5

This page was built for publication: Kempe-locking configurations