Using Kempe exchanges to disentangle Kempe chains

DOI10.1007/s00283-017-9741-yzbMath1390.05073OpenAlexW2790546731MaRDI QIDQ1649558

James A. Tilley

Publication date: 6 July 2018

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

Full work available at URL: https://doi.org/10.1007/s00283-017-9741-y

zbMATH Keywords

coloring algorithm

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Kempe-locking configurations

Cites Work

• Kempe Revisited
• D-resolvability of vertices in planar graphs
• Unnamed Item

This page was built for publication: Using Kempe exchanges to disentangle Kempe chains