Isomorphism Testing in Hookup Classes
From MaRDI portal
Cites work
Cited in
(13)- A fast parallel algorithm to recognize P4-sparse graphs
- The isomorphism problem for \(k\)-trees is complete for logspace
- Complement reducible graphs
- Isomorphism of chordal (6, 3) graphs
- Graph reconstruction from unlabeled edge lengths
- The isomorphism problem for classes of graphs closed under contraction
- The Isomorphism Problem for k-Trees Is Complete for Logspace
- Directed path graph isomorphism
- Isomorphism testing of k-trees is in NC, for fixed k
- A Dynamic Programming Approach to the Dominating Set Problem on k-Trees
- On the structure of graphs with few P₄s
- On the isomorphism of graphs with few P4s
- The Space Complexity of k-Tree Isomorphism
This page was built for publication: Isomorphism Testing in Hookup Classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3968949)