Pages that link to "Item:Q3191972"
From MaRDI portal
The following pages link to Isomorphism testing for embeddable graphs through definability (Q3191972):
Displaying 13 items.
- Counting and sampling minimum cuts in genus \(g\) graphs (Q471138) (← links)
- Spectra of symmetric powers of graphs and the Weisfeiler-Lehman refinements (Q602723) (← links)
- The first order definability of graphs: Upper bounds for quantifier depth (Q860411) (← links)
- Hashing and canonicalizing Notation 3 graphs (Q988582) (← links)
- Permutation group approach to association schemes (Q1039422) (← links)
- Succinct definitions in the first order theory of graphs (Q2368907) (← links)
- The first order definability of graphs with separators via the Ehrenfeucht game (Q2570131) (← links)
- From Invariants to Canonization in Parallel (Q3503640) (← links)
- (Q5091279) (← links)
- CFI Construction and Balanced Graphs (Q5321700) (← links)
- (Q5743478) (← links)
- Canonisation and Definability for Graphs of Bounded Rank Width (Q5875948) (← links)
- Minimum Cuts in Surface Graphs (Q5885599) (← links)