arXiv (OAI Expanded)
open access
Colored Interaction-Profile Realization: Complexity of Matching-Match on Spiders
Network motifs and colored local interaction patterns provide a useful way to describe the structure of complex networks. Motivated by an inverse realization perspective, we study the problem of assigning colors to the vertices of a fixed graph so that its edges realize a prescribed multiset of colo
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 Method that can Generate Ramsey Colourings for Eight and Thirteen Colours#1063062
- Combinatorial Optimization#66996
- Generalizing association rules in n-ary relations : application to dynamic graph analysis#231445
- Self-Assembling Networks#698334
- Complexity, approximation, and extension of proper $\{a,b\}$-edge-weightings#1105763
Record · ID 1083584
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