☆ 4.2 Article

In most 6-regular toroidal graphs all 5-colorings are Kempe equivalent

EUROPEAN JOURNAL OF COMBINATORICS (2022)

相关参考文献

注意：仅列出部分参考文献，下载原文获取全部文献信息。

Article Mathematics

Reconfiguring colorings of graphs with bounded maximum average degree

Carl Feghali

Summary: This paper proves that for a graph G with n vertices and maximum average degree of d - epsilon, the diameter of the reconfiguration graph R-k(G) is O(n(log n)(d-1)), where epsilon is a positive constant. This significantly strengthens several existing results in the field.

JOURNAL OF COMBINATORIAL THEORY SERIES B (2021)

添加到收藏夹

Article Mathematics

On a conjecture of Mohar concerning Kempe equivalence of regular graphs

Marthe Bonamy et al.

JOURNAL OF COMBINATORIAL THEORY SERIES B (2019)

添加到收藏夹

Article Mathematics

Paths between colourings of sparse graphs

Carl Feghali

EUROPEAN JOURNAL OF COMBINATORICS (2019)

添加到收藏夹

Article Mathematics

Kempe equivalence of colourings of cubic graphs

Carl Feghali et al.

EUROPEAN JOURNAL OF COMBINATORICS (2017)

添加到收藏夹

Article Mathematics

Fast recoloring of sparse graphs

Nicolas Bousquet et al.

EUROPEAN JOURNAL OF COMBINATORICS (2016)

添加到收藏夹

Article Computer Science, Interdisciplinary Applications

Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs

Marthe Bonamy et al.

JOURNAL OF COMBINATORIAL OPTIMIZATION (2014)

添加到收藏夹

Article Mathematics

Mixing 3-colourings in bipartite graphs

Luis Cereceda et al.

EUROPEAN JOURNAL OF COMBINATORICS (2009)

添加到收藏夹

Article Physics, Multidisciplinary

A new Kempe invariant and the (non)-ergodicity of the Wang-Swendsen-Kotecky algorithm

Bojan Mohar et al.

JOURNAL OF PHYSICS A-MATHEMATICAL AND THEORETICAL (2009)

添加到收藏夹

Article Mathematics

Connectedness of the graph of vertex-colourings

Luis Cereceda et al.

DISCRETE MATHEMATICS (2008)

添加到收藏夹

© Peeref 2019-2024. All rights reserved.