Pages that link to "Item:Q713316"
From MaRDI portal
The following pages link to Reconfiguration of list edge-colorings in a graph (Q713316):
Displaying 30 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)
- On the parameterized complexity of reconfiguration of connected dominating sets (Q832526) (← links)
- Reconfiguration on nowhere dense graph classes (Q1658772) (← links)
- Reconfiguration graphs of shortest paths (Q1660288) (← links)
- Reconfiguration on sparse graphs (Q1747496) (← links)
- On girth and the parameterized complexity of token sliding and Token Jumping (Q1979464) (← links)
- Irredundance graphs (Q2081464) (← links)
- Parameterized complexity of reconfiguration of atoms (Q2154105) (← 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)
- Using contracted solution graphs for solving reconfiguration problems (Q2329308) (← links)
- Introduction to reconfiguration (Q2331456) (← links)
- Reconfiguring dominating sets in some well-covered and other classes of graphs (Q2397524) (← links)
- Rerouting shortest paths in planar graphs (Q2403796) (← 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)
- (Q5026983) (← links)
- Reconfiguring vertex colourings of 2-trees (Q5217099) (← links)
- Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas (Q5361235) (← links)
- Reconfiguration of satisfying assignments and subset sums: easy to find, hard to connect (Q5916254) (← links)
- Reconfiguration of Hamiltonian Cycles in Rectangular Grid Graphs (Q6066461) (← links)
- (Q6087216) (← links)
- (Q6089671) (← links)
- Kempe equivalent list edge-colorings of planar graphs (Q6091809) (← links)
- Token sliding on graphs of girth five (Q6182683) (← links)
