Pages that link to "Item:Q3590975"
From MaRDI portal
The following pages link to Planar Graphs: Logical Complexity and Parallel Isomorphism Tests (Q3590975):
Displaying 4 items.
- The isomorphism problem for planar 3-connected graphs is in unambiguous logspace (Q1959391) (← links)
- Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs (Q3586010) (← links)
- Decidable Relationships between Consistency Notions for Constraint Satisfaction Problems (Q3644743) (← links)
- Distributed Testing of Graph Isomorphism in the CONGEST Model. (Q6084362) (← links)