arXiv (All)
open access
Deterministic Edge Coloring with few Colors in CONGEST
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
- Deterministic Edge Coloring with few Colors in CONGEST#633411
- A Fast Deterministic Algorithm for $(Δ+1)$-edge coloring in CONGEST#467095
- Characterizing optimal monitoring edge-geodetic sets for some structured graph classes#14161
- $(2,\mathcal{F})$-Avoiding Coloring and B-Coloring under Bipartite Exclusions#1144883
- Color Eliminativism (2006 Manuscript)#759306
Record · ID 635760
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