HAL (France)
open access
A note on connected greedy edge colouring
Following a given ordering of the edges of a graph $G$, the greedy edge colouring procedure assigns to each edge the smallest available colour. The minimum number of colours thus involved is the chromatic index $\chi'(G)$, and the maximum is the so-called Grundy chromatic index. Here, we are interes
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
- Order 14 is the largest order for which every 4-total coloring of every cubic graph is equitable#972196
- Majority C-coloring in Cartesian products#780968
- Majority C-coloring in Cartesian products#779593
- A note on the multicolor size-Ramsey numbers of connected graphs#128283
- Dynamic Coloring and Graph Squares of Regular Graphs#1233604
Record · ID 1329147
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