arXiv (OAI Expanded)
open access
On the Expressive Power of Implicit Line-Graph Higher-Order Weisfeiler--Leman
Whitney's theorem allows isomorphism testing for connected simple graphs, apart from $K_3$ and $K_{1,3}$, to be formulated as distinguishing their line graphs. However, the relation between fixed-dimensional Weisfeiler--Leman (WL) expressivity on line graphs and on their roots remains unresolved. We
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- A New Sufficient Condition for Oriented Graphs Determined by Their Generalized Skew Spectra#926349
- Largest connected component in duplication-divergence growing graphs with symmetric coupled divergence#1049739
- Separator Theorem for Minor-Free Graphs in Linear Time#986177
- Graded multiplicities in the Kostant-Rallis setting#798547
- Graded multiplicities in the Kostant-Rallis setting#797134
Record · ID 1110772
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive