Isomorphism testing for T-graphs in FPT
From MaRDI portal
Publication:2154101
Cites work
- Algorithmic Aspects of Vertex Elimination on Graphs
- Algorithmic graph theory and perfect graphs
- Enumeration of the perfect sequences of a chordal graph
- Extending partial representations of subclasses of chordal graphs
- Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth
- Graph isomorphism problem
- 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 7559375 (Why is no real title available?)
- Isomorphism of graph classes related to the circular-ones property
- Linear Time Automorphism Algorithms for Trees, Interval Graphs, and Planar Graphs
- On \(H\)-topological intersection graphs
- On testing isomorphism of permutation graphs
- 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
(5)- Efficient isomorphism for \(S_d\)-graphs and \(T\)-graphs
- Testing isomorphism of chordal graphs of bounded leafage is fixed-parameter tractable (extended abstract)
- Recognition and isomorphism of proper \(H \)-graphs for unicyclic \(H\) in \textit{FPT}-time
- Testing isomorphism of chordal graphs of bounded leafage is fixed-parameter tractable
- Solution-hashing search based on layout-graph transformation for unequal circle packing
This page was built for publication: Isomorphism testing for \(T\)-graphs in FPT
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2154101)
