Reconfiguration of cliques in a graph

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-step fashion. As one step of a transformation, we consider three different types of rules, which are defined and studied i...

Celý popis

Podrobná bibliografia

Vydané v:	Discrete Applied Mathematics Ročník 333; s. 43 - 58
Hlavní autori:	Ito, Takehiro, Ono, Hirotaka, Otachi, Yota
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 15.07.2023
Predmet:	Clique Combinatorial reconfiguration Graph algorithm Combinatorial reconfiguration Clique Graph algorithm
ISSN:	0166-218X, 1872-6771
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!