Abstract
Biró, Hujter, and Tuza introduced the concept of H-graphs (1992), intersection graphs of connected subgraphs of a subdivision of a graph H. They naturally generalize many important classes of graphs, e.g., interval graphs and circular-arc graphs. Our paper is the first study of the recognition and dominating set problems of this large collection of intersection classes of graphs.
We negatively answer the question of Biró, Hujter, and Tuza who asked whether H-graphs can be recognized in polynomial time, for a fixed graph H. Namely, we show that recognizing H-graphs is -complete if H contains the diamond graph as a minor. On the other hand, for each tree T, we give a polynomial-time algorithm for recognizing T-graphs and an \(\mathcal {O}(n^4)\)-time algorithm for recognizing \(K_{1,d}\)-graphs. For the dominating set problem (parameterized by the size of H), we give - and -time algorithms on \(K_{1,d}\)-graphs and H-graphs, respectively. Our dominating set algorithm for H-graphs also provides -time algorithms for the independent set and independent dominating set problems on H-graphs.
This paper including its full appendix is on ArXiv, see http://arXiv.org/pdf/1608.02389v2.pdf. Thus, for any reference to an appendix, see the ArXiv version.
P. Zeman—This author was supported by Charles University as GAUK 1334217.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Biro, M., Hujter, M., Tuza, Z.: Precoloring extension I. Interval graphs. Discret. Math. 100(1), 267–279 (1992)
Bonomo, F., Mattia, S., Oriolo, G.: Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem. Theor. Comput. Sci. 412(45), 6261–6268 (2011)
Booth, K.S., Lueker, G.S.: Testing for the consecutive ones property, interval graphs, and planarity using PQ-tree algorithms. J. Comput. System Sci. 13, 335–379 (1976)
Booth, K.S., Johnson, J.H.: Dominating sets in chordal graphs. SIAM J. Comput. 11(1), 191–199 (1982)
Chang, M.S.: Efficient algorithms for the domination problems on interval and circular-arc graphs. SIAM J. Comput. 27(6), 1671–1694 (1998)
Cygan, M., Fomin, F.V., Kowalik, Ł., Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms, vol. 4. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-21275-3
Fulkerson, D.R., Gross, O.A.: Incidence matrices and interval graphs. Pac. J. Math. 15, 835–855 (1965)
Gavril, F.: The intersection graphs of subtrees in trees are exactly the chordal graphs. J. Comb. Theory, Ser. B 16(1), 47–56 (1974)
Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs, vol. 57. Elsevier, Amsterdam (2004)
Golumbic, M.C.: The complexity of comparability graph recognition and coloring. Computing 18(3), 199–208 (1977)
Klavík, P., Kratochvíl, J., Otachi, Y., Saitoh, T.: Extending partial representations of subclasses of chordal graphs. Theor. Comput. Sci. 576, 85–101 (2015)
Lueker, G.S., Booth, K.S.: A linear time algorithm for deciding interval graph isomorphism. J. ACM (JACM) 26(2), 183–195 (1979)
Rose, D.J., Tarjan, R.E., Lueker, G.S.: Algorithmic aspects of vertex elimination on graphs. SIAM J. Comput. 5(2), 266–283 (1976)
Yannakakis, M.: The complexity of the partial order dimension problem. SIAM J. Algebr. Discrete Methods 3(3), 351–358 (1982)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Chaplick, S., Töpfer, M., Voborník, J., Zeman, P. (2017). On H-Topological Intersection Graphs. In: Bodlaender, H., Woeginger, G. (eds) Graph-Theoretic Concepts in Computer Science. WG 2017. Lecture Notes in Computer Science(), vol 10520. Springer, Cham. https://doi.org/10.1007/978-3-319-68705-6_13
Download citation
DOI: https://doi.org/10.1007/978-3-319-68705-6_13
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-68704-9
Online ISBN: 978-3-319-68705-6
eBook Packages: Computer ScienceComputer Science (R0)