eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2023-08-21
8:1
8:14
10.4230/LIPIcs.MFCS.2023.8
article
Recognizing H-Graphs - Beyond Circular-Arc Graphs
Ağaoğlu Çağırıcı, Deniz
1
Çağırıcı, Onur
2
Derbisz, Jan
3
4
Hartmann, Tim A.
5
https://orcid.org/0000-0002-1028-6351
Hliněný, Petr
1
https://orcid.org/0000-0003-2125-1514
Kratochvíl, Jan
6
Krawczyk, Tomasz
3
https://orcid.org/0000-0002-8777-269X
Zeman, Peter
7
Faculty of Informatics, Masaryk University, Brno, Czech Republic
Toronto Metropolitan University, Canada
Theoretical Computer Science Department, Faculty of Mathematics and Computer Science, Jagiellonian University, Kraków, Poland
Doctoral School of Exact and Natural Sciences, Jagiellonian University, Kraków, Poland
CISPA Helmholtz Center for Information Security, Saarbrücken, Germany
Department of Applied Mathematics, Faculty of Mathematics and Physics, Charles University, Prague, Czech Republic
Technical University of Denmark, Lyngby, Denmark
In 1992 Biró, Hujter and Tuza introduced, for every fixed connected graph H, the class of H-graphs, defined as the intersection graphs of connected subgraphs of some subdivision of H. Such classes of graphs are related to many known graph classes: for example, K₂-graphs coincide with interval graphs, K₃-graphs with circular-arc graphs, the union of T-graphs, where T ranges over all trees, coincides with chordal graphs. Recently, quite a lot of research has been devoted to understanding the tractability border for various computational problems, such as recognition or isomorphism testing, in classes of H-graphs for different graphs H.
In this work we undertake this research topic, focusing on the recognition problem. Chaplick, Töpfer, Voborník, and Zeman showed an XP-algorithm testing whether a given graph is a T-graph, where the parameter is the size of the tree T. In particular, for every fixed tree T the recognition of T-graphs can be solved in polynomial time. Tucker showed a polynomial time algorithm recognizing K₃-graphs (circular-arc graphs). On the other hand, Chaplick et al. showed also that for every fixed graph H containing two distinct cycles sharing an edge, the recognition of H-graphs is NP-hard.
The main two results of this work narrow the gap between the NP-hard and 𝖯 cases of H-graph recognition. First, we show that the recognition of H-graphs is NP-hard when H contains two distinct cycles. On the other hand, we show a polynomial-time algorithm recognizing L-graphs, where L is a graph containing a cycle and an edge attached to it (which we call lollipop graphs). Our work leaves open the recognition problems of M-graphs for every unicyclic graph M different from a cycle and a lollipop.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol272-mfcs2023/LIPIcs.MFCS.2023.8/LIPIcs.MFCS.2023.8.pdf
H-graphs
Intersection Graphs
Helly Property