On Edge Coloring of Multigraphs.

Jing, G. (2023). On Edge Coloring of Multigraphs.

Type

Preprint

Intellectual base

Grey literature

Year

2023

Link

https://arxiv.org/abs/2308.15588

Cited by

1 citation across 1 artifact.

Domain-specific

• Goldberg–Seymour Theorem
  • Jing's 2023 manuscript gives a polynomial-time algorithm producing a coloring with \(\max\{\Delta+1,\Gamma_{\mathrm{int}}\}\) colors, and later work has pursued shorter proofs and constructive formulations.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:07b2feb04cac · see in the full table