Pages that link to "Item:Q3188884"
From MaRDI portal
The following pages link to Reconfiguring Independent Sets in Claw-Free Graphs (Q3188884):
Displaying 34 items.
- Finding shortest paths between graph colourings (Q309791) (← links)
- Linear-time algorithm for sliding tokens on trees (Q496016) (← links)
- The complexity of dominating set reconfiguration (Q517018) (← links)
- Reconfiguration in bounded bandwidth and tree-depth (Q1686224) (← 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)
- Token sliding on split graphs (Q2048202) (← links)
- On reconfigurability of target sets (Q2110378) (← links)
- Reconfiguration of regular induced subgraphs (Q2154077) (← links)
- Parameterized complexity of independent set reconfiguration problems (Q2192091) (← links)
- Using contracted solution graphs for solving reconfiguration problems (Q2329308) (← links)
- Introduction to reconfiguration (Q2331456) (← links)
- Rerouting shortest paths in planar graphs (Q2403796) (← links)
- Reconfiguration of maximum-weight \(b\)-matchings in a graph (Q2420651) (← links)
- Reconfiguration of colorable sets in classes of perfect graphs (Q2632018) (← links)
- Shortest reconfiguration of sliding tokens on subclasses of interval graphs (Q2658043) (← links)
- Reconfiguration of cliques in a graph (Q2700609) (← links)
- Shortest Reconfiguration of Sliding Tokens on a Caterpillar (Q2803826) (← links)
- Independent Set Reconfiguration in Cographs and their Generalizations (Q2825488) (← links)
- Finding Shortest Paths Between Graph Colourings (Q2946021) (← links)
- Sliding Tokens on Block Graphs (Q2980933) (← links)
- (Q5090459) (← links)
- The Perfect Matching Reconfiguration Problem (Q5092444) (← links)
- Reconfiguration of Colorable Sets in Classes of Perfect Graphs (Q5116491) (← links)
- Homomorphism Reconfiguration via Homotopy (Q5212954) (← links)
- Reconfiguration of satisfying assignments and subset sums: easy to find, hard to connect (Q5916254) (← links)
- Independent set reconfiguration parameterized by modular-width (Q5918925) (← links)
- Token sliding on graphs of girth five (Q6043182) (← links)
- Counting independent sets in graphs with bounded bipartite pathwidth (Q6074656) (← links)
- (Q6087216) (← links)
- On the complexity of distance-\(d\) independent set reconfiguration (Q6091168) (← links)
- Galactic token sliding (Q6098154) (← links)
- On reconfiguration graphs of independent sets under token sliding (Q6115427) (← links)
- Token sliding on graphs of girth five (Q6182683) (← links)
