Pages that link to "Item:Q631762"
From MaRDI portal
The following pages link to On the complexity of reconfiguration problems (Q631762):
Displaying 50 items.
- A dichotomy theorem for circular colouring reconfiguration (Q301588) (← links)
- Finding shortest paths between graph colourings (Q309791) (← links)
- Reconfiguration of dominating sets (Q346508) (← links)
- The complexity of rerouting shortest paths (Q392173) (← links)
- Complexity of independent set reconfigurability problems (Q441866) (← links)
- Approximability of the subset sum reconfiguration problem (Q489711) (← links)
- Linear-time algorithm for sliding tokens on trees (Q496016) (← links)
- The complexity of dominating set reconfiguration (Q517018) (← links)
- On the parameterized complexity of reconfiguration problems (Q527426) (← links)
- Reconfiguration of list edge-colorings in a graph (Q713316) (← links)
- On the parameterized complexity of reconfiguration of connected dominating sets (Q832526) (← links)
- Connected \(k\)-dominating graphs (Q1618230) (← links)
- Parameterized complexity of the list coloring reconfiguration problem with graph parameters (Q1643161) (← links)
- Reconfiguring minimum dominating sets: the \(\gamma\)-graph of a tree (Q1649910) (← links)
- Reconfiguration on nowhere dense graph classes (Q1658772) (← links)
- Reconfiguration graphs of shortest paths (Q1660288) (← links)
- The packing number of the double vertex graph of the path graph (Q1671357) (← links)
- Reconfiguration in bounded bandwidth and tree-depth (Q1686224) (← links)
- Recoloring graphs via tree decompositions (Q1686264) (← links)
- Fixing improper colorings of graphs (Q1698729) (← links)
- Cut-colorings in coloring graphs (Q1733874) (← links)
- Reconfiguration on sparse graphs (Q1747496) (← links)
- Independent-set reconfiguration thresholds of hereditary graph classes (Q1801058) (← links)
- On girth and the parameterized complexity of token sliding and Token Jumping (Q1979464) (← links)
- Reconfiguring graph homomorphisms on the sphere (Q1987080) (← links)
- The \(k\)-dominating graph (Q2014712) (← links)
- Dominating sets reconfiguration under token sliding (Q2032965) (← links)
- The edge-connectivity of token graphs (Q2045395) (← links)
- Token sliding on split graphs (Q2048202) (← links)
- Irredundance graphs (Q2081464) (← links)
- On reconfigurability of target sets (Q2110378) (← links)
- Reconfiguring simple \(s\), \(t\) Hamiltonian paths in rectangular grid graphs (Q2115888) (← links)
- Multistage vertex cover (Q2135630) (← links)
- TS-reconfiguration of dominating sets in circle and circular-arc graphs (Q2140491) (← links)
- Invitation to combinatorial reconfiguration (Q2154076) (← links)
- Reconfiguration of regular induced subgraphs (Q2154077) (← links)
- Parameterized complexity of reconfiguration of atoms (Q2154105) (← links)
- Distributed reconfiguration of maximal independent sets (Q2186816) (← links)
- Parameterized complexity of independent set reconfiguration problems (Q2192091) (← links)
- Dismantlability, connectedness, and mixing in relational structures (Q2222042) (← links)
- Optimal reconfiguration of optimal ladder lotteries (Q2227490) (← 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)
- Connectivity and Hamiltonicity of canonical colouring graphs of bipartite and complete multipartite graphs (Q2331438) (← 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)
- The connectivity of Boolean satisfiability: dichotomies for formulas and circuits (Q2411031) (← links)
- The connectivity of token graphs (Q2413643) (← links)
