scientific article; zbMATH DE number 7559375

DOI10.4230/LIPIcs.MFCS.2020.4MaRDI QIDQ5089162

Deniz Ağaoğlu, Petr Hliněný

Publication date: 18 July 2022

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

intersection graphinterval graphisomorphism testing\(H\)-graph

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (2)

Isomorphism testing for \(T\)-graphs in FPT ⋮ Testing isomorphism of chordal graphs of bounded leafage is fixed-parameter tractable (extended abstract)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fundamentals of parameterized complexity
• Graph isomorphism problem
• Precoloring extension. I: Interval graphs
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• Combinatorial problems on \(H\)-graphs
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• On the Cutwidth and the Topological Bandwidth of a Tree
• Algorithmic Aspects of Vertex Elimination on Graphs
• On Tractable Parameterizations of Graph Isomorphism
• An improved isomorphism test for bounded-tree-width graphs
• Graph isomorphism in quasipolynomial time [extended abstract]
• On \(H\)-topological intersection graphs

This page was built for publication: