Titlebook: ;

碳水化合物

RACE

Independent Set Reconfiguration in Cographs,y, we show that for a graph class . that includes all chordal and claw-free graphs, the problem can be solved in polynomial time for graphs that can be obtained from a collection of graphs from . using disjoint union and complete join operations.