arXiv (All)
open access
Strong Edge Colouring of Disk Graphs: A 6-Approximation and an Improved Unit-Disk Bound
A strong edge colouring of a graph $G$ is an edge colouring in which every colour class is an induced matching. The minimum number of colours is the strong chromatic index $χ'_s(G)$. If each edge $e$ is assigned a list $L'(e)$ and its colour must belong to $L'(e)$, the corresponding parameter is the
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
- Strong edge coloring of graphs with maximum degree $6$#1119018
- Genetic Algorithm for Graph Colouring: Exploration of Galinier and Hao's algorithm#824270
- The maximum number of edges in minimal matching covered graphs#1105537
- A General Upper Bound on Multicolor Ordered Ramsey Numbers#1064619
- A stronger upper bound on the D-chromatic index#822295
Record · ID 1119096
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