Aug 8, 2016 · We prove that it is NP-complete if H contains the diamond graph as a minor. We provide a polynomial-time algorithm recognizing T-graphs, for each fixed tree T.
Jul 23, 2021 · Our paper starts a new line of research in the area of geometric intersection graphs by studying several classical computational problems on H-graphs.
Abstract. Biró et al. (1992) introduced $H$-graphs, intersection graphs of connected subgraphs of a subdivision of a graph $H$.
Nov 2, 2017 · An intersection representation of a graph assigns a set to each vertex and uses intersections of those sets to encode its edges. More formally, ...
Our paper starts a new line of research in the area of geometric intersection graphs by studying several classical computational problems on H-graphs.
Our paper starts a new line of research in the area of geometric intersection graphs by studying several classical computational problems on H-graphs: ...
Aug 11, 2016 · Bir\'o, Hujter, and Tuza introduced the concept of $H$-graphs (1992), intersection graphs of connected subgraphs of a subdivision of a graph ...
A graph G is a topological intersection graph of H if G is an intersection graph of a subdivision H0 of H. We say that G is an H-graph and the collection {H0.
Chaplick, S., Töpfer, M., Voborník, J., & Zeman, P. (2016). On H-Topological Intersection Graphs. https://arxiv.org/abs/1608.02389.
On H-Topological Intersection Graphs | Request PDF - ResearchGate
www.researchgate.net › ... › 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 ...