Toward Cereceda's conjecture for planar graphs

DOI10.1002/jgt.22518zbMath1495.05091arXiv1810.00731OpenAlexW2988006156WikidataQ122950000 ScholiaQ122950000MaRDI QIDQ5110690

Carl Feghali, Eduard Eiben

Publication date: 21 May 2020

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1810.00731

zbMATH Keywords

graph coloringplanar graphreconfiguration graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items (6)

Decreasing the maximum average degree by deleting an independent set or a \(d\)-degenerate subgraph ⋮ A polynomial version of Cereceda's conjecture ⋮ Reconfiguring 10-colourings of planar graphs ⋮ Strengthening a Theorem of Meyniel ⋮ Reconfiguring colorings of graphs with bounded maximum average degree ⋮ An update on reconfiguring 10-colorings of planar graphs

This page was built for publication: Toward Cereceda's conjecture for planar graphs