A Reconfigurations Analogue of Brooks’ Theorem

DOI10.1007/978-3-662-44465-8_25zbMath1426.05042OpenAlexW312305493MaRDI QIDQ2922616

Carl Feghali, Matthew Johnson, Daniël Paulusma

Publication date: 14 October 2014

Published in: Mathematical Foundations of Computer Science 2014 (Search for Journal in Brave)

Full work available at URL: http://dro.dur.ac.uk/14213/1/14213.pdf

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15)

Related Items (4)

Classifying coloring graphs ⋮ Reconfiguration in bounded bandwidth and tree-depth ⋮ Recoloring graphs via tree decompositions ⋮ Kempe equivalence of colourings of cubic graphs

This page was built for publication: A Reconfigurations Analogue of Brooks’ Theorem