Kempe changes in degenerate graphs

DOI10.1016/J.EJC.2023.103802zbMATH Open1542.05052MaRDI QIDQ6563986FDOQ6563986

Vincent Delecroix, Marthe Bonamy, Clément Legrand-Duchesne

Publication date: 28 June 2024

Published in: European Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

list coloringdegree boundsbounded maximum average degree\(k\)-colorings

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Coloring of graphs and hypergraphs (05C15)

Cites Work

• A linear time algorithm for finding tree-decompositions of small treewidth
• SOME UNSOLVED PROBLEMS IN GRAPH THEORY
• Improved bounds for sampling colorings
• The complexity of change
• Title not available (Why is that?)
• Algorithmic Aspects of Vertex Elimination on Graphs
• Kempe classes and the Hadwiger conjecture
• A polynomial version of Cereceda's conjecture
• Recoloring graphs via tree decompositions
• A new Kempe invariant and the (non)-ergodicity of the Wang–Swendsen–Kotecký algorithm
• A personal list of unsolved problems concerning lattice gases and antiferromagnetic Potts models
• Brooks' Theorem and Beyond
• Fast recoloring of sparse graphs
• On a conjecture of Mohar concerning Kempe equivalence of regular graphs
• Kempe equivalence of colourings of cubic graphs
• Diameter of colorings under Kempe changes
• On an estimate of the chromatic class of a \(p\)-graph

This page was built for publication: Kempe changes in degenerate graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6563986)