Kempe changes in degenerate graphs
From MaRDI portal
Publication:6563986
Recommendations
Cites work
- scientific article; zbMATH DE number 5130739 (Why is no real title available?)
- A linear time algorithm for finding tree-decompositions of small treewidth
- 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
- A polynomial version of Cereceda's conjecture
- Algorithmic Aspects of Vertex Elimination on Graphs
- Brooks' Theorem and Beyond
- Diameter of colorings under Kempe changes
- Fast recoloring of sparse graphs
- Improved bounds for sampling colorings
- Kempe classes and the Hadwiger conjecture
- Kempe equivalence of colourings of cubic graphs
- On a conjecture of Mohar concerning Kempe equivalence of regular graphs
- On an estimate of the chromatic class of a \(p\)-graph
- Recoloring graphs via tree decompositions
- SOME UNSOLVED PROBLEMS IN GRAPH THEORY
- The complexity of change
Cited in
(3)
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)