scientific article; zbMATH DE number 7765402
From MaRDI portal
Publication:6087216
Cites work
- A dichotomy theorem for circular colouring reconfiguration
- Complexity of independent set reconfigurability problems
- Connectedness of the graph of vertex-colourings
- Fixed-parameter tractability of token jumping on planar graphs
- Flip distance between two triangulations of a point set is NP-complete
- Homomorphism reconfiguration via homotopy
- Introduction to reconfiguration
- Linear degree extractors and the inapproximability of max clique and chromatic number
- On the complexity of reconfiguration problems
- On the Parameterized Complexity for Token Jumping on Graphs
- Parameterized algorithms
- Parameterized complexity of independent set in \(H\)-free graphs
- Polynomial-time algorithm for sliding tokens on trees
- PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation
- Reconfiguration of list edge-colorings in a graph
- Reconfiguration of vertex covers in a graph
- Reconfiguring independent sets in claw-free graphs
- Shortest reconfiguration paths in the solution space of Boolean formulas
- Sliding token on bipartite permutation graphs
- The complexity of change
- The complexity of independent set reconfiguration on bipartite graphs
- The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies
- The Ramsey number R(3, t) has order of magnitude t2/log t
- Token jumping in minor-closed classes
- Token sliding on chordal graphs
- Token sliding on split graphs
- Vertex Cover Reconfiguration and Beyond
Cited in
(3)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6087216)
