Pages that link to "Item:Q1643161"
From MaRDI portal
The following pages link to Parameterized complexity of the list coloring reconfiguration problem with graph parameters (Q1643161):
Displayed 6 items.
- Using contracted solution graphs for solving reconfiguration problems (Q2329308) (← links)
- Algorithms for Coloring Reconfiguration Under Recolorability Constraints (Q5091029) (← links)
- Dismantlability, Connectedness, and Mixing in Relational Structures (Q5091178) (← links)
- Fixed-parameter algorithms for graph constraint logic (Q6041672) (← links)
- (Q6089660) (← links)
- Parameterized complexity of optimizing list vertex-coloring through reconfiguration (Q6091170) (← links)