Graph Edge Colouring

Scheide, D. (2010). Graph Edge Colouring: Tashkinov Trees and Goldberg's Conjecture. Journal of Combinatorial Theory, Series B, 68-96.

Type

Journal article

Intellectual base

Primary research

Year

2010

DOI

10.1016/j.jctb.2009.04.001

Link

https://doi.org/10.1016/j.jctb.2009.04.001

Cited by

1 citation across 1 artifact.

Domain-specific

• Goldberg–Seymour Theorem
  • The theorem says these two obvious lower-bound families are essentially complete: no loopless multigraph needs more than the larger density obstruction or one extra color beyond maximum degree.

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:56f9c45fa09f · see in the full table