TS-reconfiguration of dominating sets in circle and circular-arc graphs
From MaRDI portal
Publication:2140491
DOI10.1007/978-3-030-86593-1_8OpenAlexW3200917512MaRDI QIDQ2140491FDOQ2140491
Authors: Nicolas Bousquet, Alice Joffard 
Publication date: 20 May 2022
Full work available at URL: https://arxiv.org/abs/2102.10568
Cites Work
- PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation
- The \(k\)-dominating graph
- The complexity of change
- Finding paths between 3-colorings
- Reconfiguration of dominating sets
- The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies
- On the complexity of reconfiguration problems
- The complexity of domination problems in circle graphs
- The complexity of dominating set reconfiguration
- Introduction to reconfiguration
- The complexity of independent set reconfiguration on bipartite graphs
- On a conjecture of Mohar concerning Kempe equivalence of regular graphs
- Dominating sets reconfiguration under token sliding
- Linear transformations between dominating sets in the TAR-model
- The Perfect Matching Reconfiguration Problem
Cited In (1)
This page was built for publication: TS-reconfiguration of dominating sets in circle and circular-arc graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2140491)
