Pages that link to "Item:Q1699776"
From MaRDI portal
The following pages link to The coloring reconfiguration problem on specific graph classes (Q1699776):
Displaying 12 items.
- Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances (Q1034528) (← links)
- Parameterized complexity of the list coloring reconfiguration problem with graph parameters (Q1643161) (← links)
- Using contracted solution graphs for solving reconfiguration problems (Q2329308) (← links)
- Reconfiguration of colorable sets in classes of perfect graphs (Q2632018) (← links)
- The complexity of change (Q2875857) (← links)
- Reconfiguration of Colorable Sets in Classes of Perfect Graphs (Q5116491) (← links)
- Complexity of Coloring Reconfiguration under Recolorability Constraints (Q5136283) (← links)
- Reconfiguration of Spanning Trees with Many or Few Leaves (Q5874492) (← links)
- Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration (Q6056774) (← links)
- Parameterized complexity of optimizing list vertex-coloring through reconfiguration (Q6091170) (← links)
- Characterizing circular colouring mixing for pq<4 $\frac{p}{q}\lt 4$ (Q6093150) (← links)
- Block symmetries in graph coloring reconfiguration systems (Q6107838) (← links)
