Recoloring some hereditary graph classes
From MaRDI portal
Recommendations
- Reconfiguration of vertex colouring and forbidden induced subgraphs
- Recolouring weakly chordal graphs and the complement of triangle-free graphs
- Mixing colourings in 2K₂-free graphs
- Complexity of coloring reconfiguration under recolorability constraints
- Recolouring homomorphisms to triangle-free reflexive graphs
Cites work
- A tree representation for \(P_ 4\)-sparse graphs
- A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph
- Chromatic symmetric functions and \(H\)-free graphs
- Finding paths between 3-colourings
- Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances
- Introduction to reconfiguration
- Mixing colourings in 2K₂-free graphs
- Paw-free graphs
- Recoloring graphs via tree decompositions
- Recolouring weakly chordal graphs and the complement of triangle-free graphs
- Reconfiguration graph for vertex colourings of weakly chordal graphs
- Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs
- Reconfiguration in bounded bandwidth and tree-depth
- Reconfiguration of vertex colouring and forbidden induced subgraphs
Cited in
(5)
This page was built for publication: Recoloring some hereditary graph classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6657243)