,
Laure Morelle
,
Daniël Paulusma
Creative Commons Attribution 4.0 International license
An identification of two vertices u and v in a graph replaces them with a new vertex whose neighborhood is the union of the neighborhoods of u and v. We study the H-Identification problem, which is to decide whether a given graph G can be transformed ("identified") to a graph in H by applying at most k vertex identifications. We determine the classical and parameterized complexity of this problem for various subclasses H of chordal graphs, obtaining an almost complete picture for two parameters: k and n-k. We also consider the Identification problem, which is to test for two given graphs G and H if G can be identified to H. We determine the parameterized complexity of this problem when H is a graph from one of our testbed classes, taking the number of simplicial vertices of H as the parameter.
@InProceedings{golovach_et_al:LIPIcs.IPEC.2026.9,
author = {Golovach, Petr A. and Morelle, Laure and Paulusma, Dani\"{e}l},
title = {{Identification to Subclasses of Chordal Graphs}},
booktitle = {21st International Symposium on Parameterized and Exact Computation (IPEC 2026)},
pages = {9:1--9:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-456-7},
ISSN = {1868-8969},
year = {2026},
volume = {398},
editor = {Korhonen, Tuukka and Lampis, Michael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2026.9},
URN = {urn:nbn:de:0030-drops-281825},
doi = {10.4230/LIPIcs.IPEC.2026.9},
annote = {Keywords: vertex identification, chordal graph, parameterized complexity}
}