Pages that link to "Item:Q4635847"
From MaRDI portal
The following pages link to Universal Covers, Color Refinement, and Two-Variable Counting Logic: Lower Bounds for the Depth (Q4635847):
Displaying 9 items.
- Graph isomorphism, color refinement, and compactness (Q2410688) (← links)
- Setting Ports in an Anonymous Network: How to Reduce the Level of Symmetry? (Q2835014) (← links)
- Graphs Identified by Logics with Counting (Q2946347) (← links)
- On the Power of Color Refinement (Q2947892) (← links)
- Upper Bounds on the Quantifier Depth for Graph Differentiation in First Order Logic (Q4635884) (← links)
- Lov\'asz Meets Weisfeiler and Leman (Q5002713) (← links)
- (Q5091279) (← links)
- Unfoldings and Coverings of Weighted Graphs (Q6094515) (← links)
- Weisfeiler-Lehman goes dynamic: an analysis of the expressive power of graph neural networks for attributed and dynamic graphs (Q6536113) (← links)
