Pages that link to "Item:Q5136283"
From MaRDI portal
The following pages link to Complexity of Coloring Reconfiguration under Recolorability Constraints (Q5136283):
Displaying 13 items.
- The complexity of changing colourings with bounded maximum degree (Q407523) (← links)
- The algorithmic complexity of colour switching (Q1199936) (← links)
- The coloring reconfiguration problem on specific graph classes (Q1699776) (← links)
- Using contracted solution graphs for solving reconfiguration problems (Q2329308) (← links)
- Tight lower and upper bounds for the complexity of canonical colour refinement (Q2398207) (← links)
- Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement (Q2849306) (← links)
- Homomorphism reconfiguration via homotopy (Q2955037) (← links)
- Between Colorings and Layouts - Minimum Morphism Cost Problems (Q3439587) (← links)
- Graph homomorphism reconfiguration and frozen H‐colorings (Q5066895) (← links)
- Algorithms for Coloring Reconfiguration Under Recolorability Constraints (Q5091029) (← links)
- Making Role Assignment Feasible: A Polynomial-Time Algorithm for Computing Ecological Colorings (Q5302046) (← links)
- Parameterized complexity of optimizing list vertex-coloring through reconfiguration (Q6091170) (← links)
- Block symmetries in graph coloring reconfiguration systems (Q6107838) (← links)