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...

Full description

Bibliographic Details

Published in:	Discrete Applied Mathematics Vol. 333; pp. 43 - 58
Main Authors:	Ito, Takehiro, Ono, Hirotaka, Otachi, Yota
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 15.07.2023
Subjects:	Clique Combinatorial reconfiguration Graph algorithm Combinatorial reconfiguration Clique Graph algorithm
ISSN:	0166-218X, 1872-6771
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!