Testing isomorphism of chordal graphs of bounded leafage is fixed-parameter tractable
From MaRDI portal
Cites work
- A Faster Isomorphism Test for Graphs of Small Degree
- A Linear Time Algorithm for Deciding Interval Graph Isomorphism
- A unifying method for the design of algorithms canonizing combinatorial objects
- An improved isomorphism test for bounded-tree-width graphs
- Colored hypergraph isomorphism is fixed parameter tractable
- Combinatorial problems on \(H\)-graphs
- Domination and Cut Problems on Chordal Graphs with Bounded Leafage
- Efficient isomorphism for \(S_d\)-graphs and \(T\)-graphs
- Fixed-parameter tractability of graph isomorphism in graphs with an excluded minor
- Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth
- Forestal algebras and algebraic forests (on a new class of weakly compact graphs)
- Graph isomorphism in quasipolynomial time (extended abstract)
- Graph isomorphism in quasipolynomial time parameterized by treewidth
- scientific article; zbMATH DE number 475362 (Why is no real title available?)
- scientific article; zbMATH DE number 1849958 (Why is no real title available?)
- scientific article; zbMATH DE number 7559375 (Why is no real title available?)
- Hypergraph Isomorphism for Groups with Restricted Composition Factors
- Isomorphism of graphs of bounded valence can be tested in polynomial time
- Isomorphism testing for \(T\)-graphs in FPT
- Isomorphism Testing for Graphs Excluding Small Minors
- Isomorphism Testing Parameterized by Genus and Beyond
- Isomorphisms of cyclic combinatorial objects
- Linear Time Automorphism Algorithms for Trees, Interval Graphs, and Planar Graphs
- On 2-Subcolourings of Chordal Graphs
- On \(H\)-topological intersection graphs
- On the tractability of optimization problems on \(H\)-graphs
- Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees
- Polynomial-Time Algorithm for the Leafage of Chordal Graphs
- Precoloring extension. I: Interval graphs
- Testing isomorphism of chordal graphs of bounded leafage is fixed-parameter tractable (extended abstract)
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- The isomorphism problem for classes of graphs closed under contraction
- The leafage of a chordal graph
This page was built for publication: Testing isomorphism of chordal graphs of bounded leafage is fixed-parameter tractable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6831302)
