Pages that link to "Item:Q713316"

The following pages link to Reconfiguration of list edge-colorings in a graph (Q713316):

Displayed 11 items.

• Reconfiguration of dominating sets (Q346508) ‎ (← links)
• Approximability of the subset sum reconfiguration problem (Q489711) ‎ (← links)
• Linear-time algorithm for sliding tokens on trees (Q496016) ‎ (← links)
• On the parameterized complexity of reconfiguration problems (Q527426) ‎ (← links)
• Reconfiguration on sparse graphs (Q1747496) ‎ (← links)
• Reconfiguration of list \(L(2,1)\)-labelings in a graph (Q2250462) ‎ (← links)
• Reconfiguring dominating sets in some well-covered and other classes of graphs (Q2397524) ‎ (← links)
• A Reconfigurations Analogue of Brooks' Theorem and Its Consequences (Q2833252) ‎ (← links)
• The Complexity of (List) Edge-Coloring Reconfiguration Problem (Q2980922) ‎ (← links)
• Ground State Connectivity of Local Hamiltonians (Q3448820) ‎ (← links)
• Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas (Q3448854) ‎ (← links)