Pages that link to "Item:Q2948468"
From MaRDI portal
The following pages link to Reconfiguration of Cliques in a Graph (Q2948468):
Displaying 13 items.
- The complexity of dominating set reconfiguration (Q517018) (← links)
- Reconfiguration of regular induced subgraphs (Q2154077) (← links)
- Introduction to reconfiguration (Q2331456) (← links)
- Reconfiguration of maximum-weight \(b\)-matchings in a graph (Q2420651) (← links)
- Reconfiguration of cliques in a graph (Q2700609) (← links)
- Reconfiguration of Steiner Trees in an Unweighted Graph (Q2819500) (← links)
- The Complexity of (List) Edge-Coloring Reconfiguration Problem (Q2980922) (← links)
- Complexity of Coloring Reconfiguration under Recolorability Constraints (Q5136283) (← links)
- Reconfiguring spanning and induced subgraphs (Q5916255) (← links)
- Transportation Problem Allowing Sending and Bringing Back (Q6175213) (← links)
- Hamiltonian cycle reconfiguration with answer set programming (Q6545539) (← links)
- Recongo: bounded combinatorial reconfiguration with answer set programming (Q6545541) (← links)
- Combinatorial reconfiguration with answer set programming: algorithms, encodings, and empirical analysis (Q6575399) (← links)
