scientific article; zbMATH DE number 7559375

DOI10.4230/LIPICS.MFCS.2020.4MaRDI QIDQ5089162zbMATH OpenFDO

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

Publication date 18 July 2022

zbMATH Keywords

intersection graphinterval graphisomorphism testing\(H\)-graph

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• scientific article; zbMATH DE number 3875343
• scientific article; zbMATH DE number 3815
• scientific article; zbMATH DE number 3841910
• Graph isomorphism problem
• Efficient isomorphism for \(S_d\)-graphs and \(T\)-graphs
• Graph algebras and the graph isomorphism problem
• The isomorphism problem for classes of graphs closed under contraction
• A solution of the isomorphism problem for circulant graphs
• The graph isomorphism problem on geometric graphs
• The Isomorphism Problem For Directed Path Graphs and For Rooted Directed Path Graphs

Cites work

• scientific article; zbMATH DE number 3722702 (Why is no real title available?)
• scientific article; zbMATH DE number 49151 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 3575612 (Why is no real title available?)
• scientific article; zbMATH DE number 7378700 (Why is no real title available?)
• Algorithmic Aspects of Vertex Elimination on Graphs
• An improved isomorphism test for bounded-tree-width graphs
• Combinatorial problems on \(H\)-graphs
• Fundamentals of parameterized complexity
• Graph isomorphism in quasipolynomial time (extended abstract)
• Graph isomorphism problem
• On \(H\)-topological intersection graphs
• On the Cutwidth and the Topological Bandwidth of a Tree
• On tractable parameterizations of graph isomorphism
• Precoloring extension. I: Interval graphs
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• The intersection graphs of subtrees in trees are exactly the chordal graphs

Cited in

(4)

• The isomorphism problem for rose window graphs
• Testing isomorphism of chordal graphs of bounded leafage is fixed-parameter tractable (extended abstract)
• Isomorphism testing for \(T\)-graphs in FPT
• Recognition and isomorphism of proper \(H \)-graphs for unicyclic \(H\) in \textit{FPT}-time

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5089162)