16 citations · 41 across the 20 of their papers we have counts for
Showing 2014 · cs.DSShow all
2 papers · 2 filters
cs.DS2014
Reconfiguration of Cliques in a Graph
Takehiro Ito, Hirotaka Ono, Yota Otachi
We study reconfiguration problems for cliques in a graph, which determine whether there exists a sequence of cliques that transforms a given clique into another one in a step-by-st…
cs.DS2014★ 16 cited
The List Coloring Reconfiguration Problem for Bounded Pathwidth Graphs
Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou
We study the problem of transforming one list (vertex) coloring of a graph into another list coloring by changing only one vertex color assignment at a time, while at all times mai…