arXiv (OAI Expanded)
open access
On Edge Coloring of Multigraphs
Let $Δ(G)$ and $χ'(G)$ be the maximum degree and chromatic index of a graph $G$, respectively. Gupta\,(1967), Goldberg\,(1973), Andersen\,(1977), and Seymour\,(1979) made the following conjecture: Every multigraph $G$ satisfies $χ'(G) \le \max\{ Δ(G) + 1, Γ(G) \}$, where $Γ(G) = \max_{H \subseteq
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
- A counterexample to the quantum Hedetniemi conjecture#1034490
- Digraphs of Large Girth and Dichromatic Number in Tournaments with Large Dichromatic Number#1036284
- DP vertex-arboricity of sparse graphs#1117503
- A Hajnal-Szemerédi Theorem for Skewed Colorings#1012804
- The Partial List Colouring Conjecture is False#1049034
Record · ID 1082904
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