Diameter of colorings under Kempe changes

DOI10.1007/978-3-030-26176-4_5zbMath1456.05055OpenAlexW2963047353MaRDI QIDQ5919442

Kunihiro Wasa, Takehiro Ito, Akira Suzuki, Moritz Mühlenthaler, Marthe Bonamy, Haruka Mizuta, Yusuke Kobayashi, Marc Heinrich

Publication date: 24 February 2020

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-26176-4_5

zbMATH Keywords

Kempe equivalenceKempe connectivityKempe reachability

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

Fixed-parameter algorithms for graph constraint logic ⋮ Unnamed Item ⋮ Diameter of colorings under Kempe changes

This page was built for publication: Diameter of colorings under Kempe changes