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

DOI10.1007/978-3-030-86593-1_8OpenAlexW3200917512MaRDI QIDQ2140491

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

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