Recolouring weakly chordal graphs and the complement of triangle-free graphs

@article{Merkel2021RecolouringWC,
  title={Recolouring weakly chordal graphs and the complement of triangle-free graphs},
  author={Owen D. Merkel},
  journal={Discrete Mathematics},
  year={2021}
}
View PDF on arXiv
5 Citations
Highly Influential Citations
2
Background Citations
3

Figures from this paper

5 Citations

C O ] 2 A ug 2 02 1 Mixing colourings in 2 K 2-free graphs

The reconfiguration graph for the k-colourings of a graph G, denoted Rk(G), is the graph whose vertices are the k-colourings of G and two colourings are joined by an edge if they differ in colour on…

Towards a conjecture on the recoloring diameter of planar graphs

A list assignment L of a graph G is a function that assigns to every vertex v of G a set L ( v ) of colors. A proper coloring α of G is called an L -coloring of G if α ( v ) ∈ L ( v ) for every v ∈ V…

List recoloring of planar graphs

A list assignment L of a graph G is a function that assigns to every vertex v of G a set L ( v ) of colors. A proper coloring α of G is called an L -coloring of G if α ( v ) ∈ L ( v ) for every v ∈ V…

Reconfiguration of vertex colouring and forbidden induced subgraphs

The reconfiguration graph of the $k$-colourings, denoted $\mathcal{R}_k(G)$, is the graph whose vertices are the $k$-colourings of $G$ and two colourings are adjacent in $\mathcal{R}_k(G)$ if they…

Mixing colourings in 2K2-free graphs

7 References

Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs

It is proved that for each k≥2 there is a k-colourable chordal graph G whose reconfiguration graph of the (k+1)-colourings has diameter Θ(|V|2).

Connectedness of the graph of vertex-colourings

Reconfiguration Graph for Vertex Colourings of Weakly Chordal Graphs

The Strong Perfect Graph Theorem

A graph G is perfect if for every induced subgraph H, the chromatic number of H equals the size of the largest complete subgraph of H, and G is Berge if no induced subgraph of G is an odd cycle of…

Building a larger class of graphs for efficient reconfiguration of vertex colouring

It is proved that if G is a $k-colourable OAT graph then $\mathcal{R}_{k+1}(G)$ is connected with diameter $O(n^2)$ and polynomial time algorithms to recognize OAT graphs are given.

Recoloring graphs via tree decompositions

Normal hypergraphs and the perfect graph conjecture