Token sliding on chordal graphs
From MaRDI portal
Publication:1687909
DOI10.1007/978-3-319-68705-6_10zbMath1483.05173arXiv1605.00442OpenAlexW2345745843MaRDI QIDQ1687909
Nicolas Bousquet, Marthe Bonamy
Publication date: 4 January 2018
Full work available at URL: https://arxiv.org/abs/1605.00442
Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (24)
Decremental Optimization of Dominating Sets Under the Reconfiguration Framework ⋮ Reconfiguration of colorable sets in classes of perfect graphs ⋮ Invitation to combinatorial reconfiguration ⋮ Shortest reconfiguration of sliding tokens on subclasses of interval graphs ⋮ Token sliding on graphs of girth five ⋮ Feedback vertex set reconfiguration in planar graphs ⋮ On the complexity of distance-\(d\) independent set reconfiguration ⋮ Reconfiguration of connected graph partitions ⋮ Galactic token sliding ⋮ Parameterized complexity of independent set reconfiguration problems ⋮ On reconfiguration graphs of independent sets under token sliding ⋮ Token sliding on graphs of girth five ⋮ Extremal independent set reconfiguration ⋮ Reconfiguration of cliques in a graph ⋮ Unnamed Item ⋮ Reconfiguration of Spanning Trees with Many or Few Leaves ⋮ On girth and the parameterized complexity of token sliding and Token Jumping ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Incremental optimization of independent sets under the reconfiguration framework ⋮ Independent set reconfiguration parameterized by modular-width ⋮ Token sliding on split graphs ⋮ Reconfiguration of Colorable Sets in Classes of Perfect Graphs ⋮ Introduction to reconfiguration
This page was built for publication: Token sliding on chordal graphs