Reconfiguration of Colorable Sets in Classes of Perfect Graphs

DOI10.4230/LIPIcs.SWAT.2018.27zbMath1477.68231OpenAlexW2963009577MaRDI QIDQ5116491

Yota Otachi, Takehiro Ito

Publication date: 25 August 2020

Full work available at URL: https://dblp.uni-trier.de/db/journals/corr/corr1802.html#abs-1802-06511

zbMATH Keywords

perfect graphreconfigurationcolorable set

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Perfect graphs (05C17)

Related Items

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Complexity of independent set reconfigurability problems
• Linear-time algorithm for sliding tokens on trees
• On the parameterized complexity of reconfiguration problems
• On the complexity of reconfiguration problems
• Finding a maximum-weight induced \(k\)-partite subgraph of an \(i\)-triangulated graph
• Geometric algorithms and combinatorial optimization
• Some simplified NP-complete graph problems
• Efficient graph representations
• Token sliding on chordal graphs
• Algorithmic graph theory and perfect graphs
• Incidence matrices and interval graphs
• PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation
• The complexity of change
• LP Approaches to Improved Approximation for Clique Transversal in Perfect Graphs
• ON COMPUTING LONGEST PATHS IN SMALL GRAPH CLASSES
• Reconfiguring Independent Sets in Claw-Free Graphs
• Parameterized Algorithms for (r,l)-Partization
• A Characterization of Comparability Graphs and of Interval Graphs