Pages that link to "Item:Q2920122"
From MaRDI portal
The following pages link to Graph isomorphism for \(K_{3,3}\)-free and \(K_5\)-free graphs is in Log-space (Q2920122):
Displaying 15 items.
- A Fourier-theoretic approach for inferring symmetries (Q390110) (← links)
- Counting the number of perfect matchings in \(K_{5}\)-free graphs (Q503455) (← links)
- On the complexity of matroid isomorphism problem (Q639843) (← links)
- The isomorphism problem for \(k\)-trees is complete for logspace (Q714733) (← links)
- Restricted space algorithms for isomorphism on bounded treewidth graphs (Q714737) (← links)
- The isomorphism problem for planar 3-connected graphs is in unambiguous logspace (Q1959391) (← links)
- Revising Johnson's table for the 21st century (Q2091799) (← links)
- Graphs of Bounded Treewidth Can Be Canonized in $\mbox{{\sf AC}$^1$}$ (Q3007628) (← links)
- Some Tractable Win-Lose Games (Q3010417) (← links)
- Planarity Testing Revisited (Q3010433) (← links)
- 3-connected Planar Graph Isomorphism is in Log-space (Q3165955) (← links)
- Reachability in \(K_{3,3}\)-free and \(K_5\)-free graphs is in unambiguous logspace (Q3191145) (← links)
- (Q4910756) (← links)
- (Q5147400) (← links)
- Count-free Weisfeiler-Leman and group isomorphism (Q6545240) (← links)
