Pages that link to "Item:Q2436666"
From MaRDI portal
The following pages link to Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs (Q2436666):
Displaying 41 items.
- Finding shortest paths between graph colourings (Q309791) (← links)
- Linear-time algorithm for sliding tokens on trees (Q496016) (← links)
- The complexity of dominating set reconfiguration (Q517018) (← links)
- Paths between colourings of sparse graphs (Q1621073) (← links)
- Parameterized complexity of the list coloring reconfiguration problem with graph parameters (Q1643161) (← links)
- Reconfiguration graphs of shortest paths (Q1660288) (← links)
- On a conjecture of Mohar concerning Kempe equivalence of regular graphs (Q1719578) (← links)
- Paths between colourings of graphs with bounded tree-width (Q1721933) (← links)
- A Thomassen-type method for planar graph recoloring (Q2033925) (← links)
- Recolouring weakly chordal graphs and the complement of triangle-free graphs (Q2065883) (← links)
- In most 6-regular toroidal graphs all 5-colorings are Kempe equivalent (Q2143401) (← links)
- List-recoloring of sparse graphs (Q2145762) (← links)
- Mixing colourings in \(2K_2\)-free graphs (Q2166319) (← links)
- On strictly chordality-\(k\) graphs (Q2181248) (← links)
- Characterization of 2-path signed network (Q2221636) (← links)
- An update on reconfiguring 10-colorings of planar graphs (Q2223443) (← links)
- Reconfiguration of list \(L(2,1)\)-labelings in a graph (Q2250462) (← links)
- Classification of reconfiguration graphs of shortest path graphs with no induced 4-cycles (Q2279287) (← links)
- Reconfiguration graph for vertex colourings of weakly chordal graphs (Q2286594) (← links)
- Using contracted solution graphs for solving reconfiguration problems (Q2329308) (← links)
- Introduction to reconfiguration (Q2331456) (← links)
- Reconfiguration of maximum-weight \(b\)-matchings in a graph (Q2420651) (← links)
- Decremental optimization of vertex-coloring under the reconfiguration framework (Q2695300) (← links)
- Independent Set Reconfiguration in Cographs and their Generalizations (Q2825488) (← links)
- A Reconfigurations Analogue of Brooks' Theorem and Its Consequences (Q2833252) (← links)
- Finding Shortest Paths Between Graph Colourings (Q2946021) (← links)
- Reconfiguration of Vertex Covers in a Graph (Q2946052) (← links)
- The Complexity of (List) Edge-Coloring Reconfiguration Problem (Q2980922) (← links)
- (Q5026983) (← links)
- (Q5075761) (← links)
- Algorithms for Coloring Reconfiguration Under Recolorability Constraints (Q5091029) (← links)
- Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters (Q5111266) (← links)
- Complexity of Coloring Reconfiguration under Recolorability Constraints (Q5136283) (← links)
- Recoloring Planar Graphs of Girth at Least Five (Q5883290) (← links)
- Kempe equivalence of colourings of cubic graphs (Q5890904) (← links)
- Reconfiguration of satisfying assignments and subset sums: easy to find, hard to connect (Q5916254) (← links)
- Kempe equivalence of colourings of cubic graphs (Q5965525) (← links)
- Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration (Q6056774) (← links)
- 5‐Coloring reconfiguration of planar graphs with no short odd cycles (Q6199387) (← links)
- Strengthening the directed Brooks' theorem for oriented graphs and consequences on digraph redicolouring (Q6201022) (← links)
- Reconfiguration of vertex colouring and forbidden induced subgraphs (Q6201889) (← links)
