Pages that link to "Item:Q1686224"
From MaRDI portal
The following pages link to Reconfiguration in bounded bandwidth and tree-depth (Q1686224):
Displayed 40 items.
- Parameterized complexity of the list coloring reconfiguration problem with graph parameters (Q1643161) (← links)
- Reconfiguration on nowhere dense graph classes (Q1658772) (← 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)
- Dominating sets reconfiguration under token sliding (Q2032965) (← links)
- Token sliding on split graphs (Q2048202) (← links)
- On reconfigurability of target sets (Q2110378) (← links)
- Invitation to combinatorial reconfiguration (Q2154076) (← links)
- Reconfiguration of regular induced subgraphs (Q2154077) (← links)
- Parameterized complexity of independent set reconfiguration problems (Q2192091) (← links)
- Width, depth, and space: tradeoffs between branching and dynamic programming (Q2287480) (← links)
- Using contracted solution graphs for solving reconfiguration problems (Q2329308) (← links)
- Introduction to reconfiguration (Q2331456) (← links)
- On the complexity of restoring corrupted colorings (Q2424718) (← links)
- Reconfiguration of colorable sets in classes of perfect graphs (Q2632018) (← links)
- Decremental optimization of vertex-coloring under the reconfiguration framework (Q2695300) (← links)
- A note on the connected game coloring number (Q2700603) (← links)
- Reconfiguration of cliques in a graph (Q2700609) (← links)
- The Complexity of (List) Edge-Coloring Reconfiguration Problem (Q2980922) (← links)
- Games, Puzzles and Treewidth (Q5042461) (← links)
- Algorithms for Coloring Reconfiguration Under Recolorability Constraints (Q5091029) (← links)
- Reconfiguration of Minimum Steiner Trees via Vertex Exchanges (Q5092443) (← links)
- The Perfect Matching Reconfiguration Problem (Q5092444) (← links)
- Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters (Q5111266) (← links)
- Homomorphism Reconfiguration via Homotopy (Q5212954) (← links)
- Reconfiguration of Spanning Trees with Many or Few Leaves (Q5874492) (← links)
- Reconfiguration of satisfying assignments and subset sums: easy to find, hard to connect (Q5916254) (← links)
- Reconfiguring spanning and induced subgraphs (Q5916255) (← links)
- Incremental optimization of independent sets under the reconfiguration framework (Q5918743) (← links)
- Independent set reconfiguration parameterized by modular-width (Q5918925) (← links)
- Token sliding on graphs of girth five (Q6043182) (← links)
- Order Reconfiguration under Width Constraints (Q6075707) (← links)
- Reconfiguration of vertex-disjoint shortest paths on graphs (Q6091163) (← links)
- On the complexity of distance-\(d\) independent set reconfiguration (Q6091168) (← links)
- Parameterized complexity of optimizing list vertex-coloring through reconfiguration (Q6091170) (← links)
- Characterizing circular colouring mixing for pq<4 $\frac{p}{q}\lt 4$ (Q6093150) (← links)
- Extremal independent set reconfiguration (Q6133144) (← links)
- Token sliding on graphs of girth five (Q6182683) (← links)
- Reconfiguration of vertex colouring and forbidden induced subgraphs (Q6201889) (← links)