arXiv (All)
open access
Complexity, approximation, and extension of proper $\{a,b\}$-edge-weightings
For distinct integers $a$ and $b$, an $\{a,b\}$-edge-weighting assigns $a$ or $b$ to each edge and labels each vertex by the sum of its incident weights. Such a weighting is proper if adjacent vertices receive distinct labels. We prove that, for every fixed pair of distinct integers, deciding whethe
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
- Multiplicative Attributes Derived from Graph Invariants for Saztec4 Diamond#274870
- Polynomial-time recognition and maximum independent set in Burling graphs#174041
- Polynomial-time recognition and maximum independent set in Burling graphs#173463
- Polynomial-time recognition and maximum independent set in Burling graphs#173213
- Polynomial-time recognition and maximum independent set in Burling graphs#172197
Record · ID 1105763
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