Graph isomorphism for K₃,3-free and K₅-free graphs is in Log-space
From MaRDI portal
Publication:2920122
Recommendations
- Isomorphism Testing for Graphs Excluding Small Minors
- The isomorphism problem for \(k\)-trees is complete for logspace
- The isomorphism problem for planar 3-connected graphs is in unambiguous logspace
- 3-connected Planar Graph Isomorphism is in Log-space
- Reachability in \(K_{3,3}\)-free and \(K_5\)-free graphs is in unambiguous logspace
Cited in
(18)- Reachability in \(K_{3,3}\)-free and \(K_5\)-free graphs is in unambiguous logspace
- Restricted space algorithms for isomorphism on bounded treewidth graphs
- The isomorphism problem for \(k\)-trees is complete for logspace
- 3-connected Planar Graph Isomorphism is in Log-space
- Some tractable win-lose games
- Graphs of bounded treewidth can be canonized in AC^1
- scientific article; zbMATH DE number 7301804 (Why is no real title available?)
- The isomorphism problem for planar 3-connected graphs is in unambiguous logspace
- scientific article; zbMATH DE number 6146491 (Why is no real title available?)
- On the complexity of matroid isomorphism problem
- Structure theorem and isomorphism test for graphs with excluded topological subgraphs
- On the parallel complexity of group isomorphism via Weisfeiler-Leman
- Faster isomorphism for p-groups of class 2 and exponent p
- Counting the number of perfect matchings in \(K_{5}\)-free graphs
- Planarity testing revisited
- Revising Johnson's table for the 21st century
- Count-free Weisfeiler-Leman and group isomorphism
- A Fourier-theoretic approach for inferring symmetries
This page was built for publication: Graph isomorphism for \(K_{3,3}\)-free and \(K_5\)-free graphs is in Log-space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2920122)
