Pages that link to "Item:Q2250462"
From MaRDI portal
The following pages link to Reconfiguration of list \(L(2,1)\)-labelings in a graph (Q2250462):
Displaying 7 items.
- A dichotomy theorem for circular colouring reconfiguration (Q301588) (← links)
- Complexity of the game domination problem (Q313955) (← links)
- Linear-time algorithm for sliding tokens on trees (Q496016) (← links)
- Using contracted solution graphs for solving reconfiguration problems (Q2329308) (← links)
- Connectivity and Hamiltonicity of canonical colouring graphs of bipartite and complete multipartite graphs (Q2331438) (← links)
- Introduction to reconfiguration (Q2331456) (← links)
- A Reconfigurations Analogue of Brooks' Theorem and Its Consequences (Q2833252) (← links)
