TS-reconfiguration of dominating sets in circle and circular-arc graphs

DOI10.1007/978-3-030-86593-1_8MaRDI QIDQ2140491OpenAlexFDO

Authors Nicolas Bousquet, Alice Joffard

Publication date 20 May 2022

Full work available at URL https://arxiv.org/abs/2102.10568

zbMATH Keywords

circular-arc graphsdominating setsreconfigurationcircle graphstoken sliding

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• Dominating sets reconfiguration under token sliding
• Finding paths between 3-colorings
• Introduction to reconfiguration
• Linear transformations between dominating sets in the TAR-model
• On a conjecture of Mohar concerning Kempe equivalence of regular graphs
• On the complexity of reconfiguration problems
• PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation
• The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies
• The Perfect Matching Reconfiguration Problem
• The \(k\)-dominating graph
• The complexity of change
• The complexity of dominating set reconfiguration
• The complexity of domination problems in circle graphs
• The complexity of independent set reconfiguration on bipartite graphs

Cited in

(1)

• TS-Reconfiguration of Dominating Sets in circle and circular-arc graphs

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)