For chordal graphs, k-colorings with k ≥ d+4 admit single-vertex recoloring transformations of length at most f(Δ)·n, with a linear-time algorithm to compute the sequence.
On the non-ergodicity of the Swendsen–Wang–Kotecký algorithm on the Kagomé lattice.Journal of Statistical Mechanics: Theory and Experiment , 2010(05):P05016,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DM 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Linear transformations between colorings in chordal graphs
For chordal graphs, k-colorings with k ≥ d+4 admit single-vertex recoloring transformations of length at most f(Δ)·n, with a linear-time algorithm to compute the sequence.