Isomorphism testing for \(T\)-graphs in FPT

DOI10.1007/978-3-030-96731-4_20OpenAlexW3216844390MaRDI QIDQ2154101

Deniz Ağaoğlu Çağırıcı, Petr Hliněný

Publication date: 13 July 2022

Full work available at URL: https://arxiv.org/abs/2111.10910

zbMATH Keywords

chordal graphparameterized complexitygraph isomorphismleafage\(H\)-graph

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (2)

Testing isomorphism of chordal graphs of bounded leafage is fixed-parameter tractable (extended abstract) ⋮ Efficient isomorphism for \(S_d\)-graphs and \(T\)-graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Enumeration of the perfect sequences of a chordal graph
• Graph isomorphism problem
• Precoloring extension. I: Interval graphs
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• Algorithmic graph theory and perfect graphs
• Extending partial representations of subclasses of chordal graphs
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth
• Linear Time Automorphism Algorithms for Trees, Interval Graphs, and Planar Graphs
• On testing isomorphism of permutation graphs
• Algorithmic Aspects of Vertex Elimination on Graphs
• On Tractable Parameterizations of Graph Isomorphism
• On \(H\)-topological intersection graphs

This page was built for publication: Isomorphism testing for \(T\)-graphs in FPT