Pages that link to "Item:Q2946347"
From MaRDI portal
The following pages link to Graphs Identified by Logics with Counting (Q2946347):
Displaying 11 items.
- The Weisfeiler-Leman dimension of chordal bipartite graphs without bipartite claw (Q2045400) (← links)
- Graph isomorphism, color refinement, and compactness (Q2410688) (← links)
- Graphs Identified by Logics with Counting (Q2946347) (← links)
- On Tinhofer’s Linear Programming Approach to Isomorphism Testing (Q2946374) (← links)
- On the Power of Color Refinement (Q2947892) (← links)
- Upper Bounds on the Quantifier Depth for Graph Differentiation in First Order Logic (Q4635884) (← links)
- Identifiability of Graphs with Small Color Classes by the Weisfeiler--Leman Algorithm (Q5009334) (← links)
- (Q5091279) (← links)
- On Weisfeiler-Leman invariance: subgraph counts and related graph properties (Q5918849) (← links)
- The Weisfeiler-Leman dimension of distance-hereditary graphs (Q6166669) (← links)
- Choiceless polynomial time with witnessed symmetric choice (Q6649460) (← links)
