arXiv (All)
open access
An 18-colour bound for locally irregular decompositions
A graph is locally irregular if adjacent vertices have distinct degrees. A graph G is decomposable if its edge set can be decomposed into locally irregular graphs, and its locally irregular chromatic index lir(G) is the least number of graphs in such a decomposition. We prove that lir(G) <= 18 for e
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
- On the largest independent sets in the Kneser graph on chambers of PG(4,q)#350962
- Coloring Small $K_t$-Minor-Free Graphs#986042
- Faster Minimum k-Cut II: Near-Optimal and Deterministic for Weighted Graphs#1064341
- A Brooks-like result for graph powers $#983875
- Proper conflict-free choosability of sparse graphs with girth at least seven#998793
Record · ID 987111
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