On \(H\)-topological intersection graphs
From MaRDI portal
Publication:5915791
DOI10.1007/978-3-319-68705-6_13zbMath1483.05175arXiv1608.02389OpenAlexW2964198611MaRDI QIDQ5915791
Steven Chaplick, Martin Töpfer, Peter Zeman, Jan Voborník
Publication date: 4 January 2018
Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1608.02389
Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (13)
Isomorphism testing for \(T\)-graphs in FPT ⋮ Testing isomorphism of chordal graphs of bounded leafage is fixed-parameter tractable (extended abstract) ⋮ Efficient isomorphism for \(S_d\)-graphs and \(T\)-graphs ⋮ Treewidth versus clique number. II: Tree-independence number ⋮ On the tractability of optimization problems on \(H\)-graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Recognizing Proper Tree-Graphs ⋮ Unnamed Item ⋮ Finding cut-vertices in the square roots of a graph ⋮ On \(H\)-topological intersection graphs ⋮ Kernelization of Graph Hamiltonicity: Proper $H$-Graphs ⋮ Mim-width. III. Graph powers and generalized distance domination problems
This page was built for publication: On \(H\)-topological intersection graphs
