Reconfiguration of Cliques in a Graph

DOI10.1007/978-3-319-17142-5_19zbMath1462.05280arXiv1412.3976OpenAlexW1783801030MaRDI QIDQ2948468

Takehiro Ito, Hirotaka Ono, Yota Otachi

Publication date: 30 September 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

planar graphsbipartite graphschordal graphsbounded treewidth graphsreconfiguration problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Perfect graphs (05C17)

Related Items (10)

Reconfiguration of regular induced subgraphs ⋮ Reconfiguration of maximum-weight \(b\)-matchings in a graph ⋮ Transportation Problem Allowing Sending and Bringing Back ⋮ Reconfiguration of cliques in a graph ⋮ The Complexity of (List) Edge-Coloring Reconfiguration Problem ⋮ The complexity of dominating set reconfiguration ⋮ Reconfiguring spanning and induced subgraphs ⋮ Reconfiguration of Steiner Trees in an Unweighted Graph ⋮ Introduction to reconfiguration ⋮ Complexity of Coloring Reconfiguration under Recolorability Constraints

This page was built for publication: Reconfiguration of Cliques in a Graph