Abstract
As we mentioned in Chap. 1, one of the most celebrated conjectures concerning edge colouring is the Goldberg-Seymour Conjecture which states that for any multigraph G: χe , (G) ≤ max(Δ + 1, ⌈χ * e (G)⌉).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Molloy, M., Reed, B. (2002). The Asymptotics of Edge Colouring Multigraphs. In: Graph Colouring and the Probabilistic Method. Algorithms and Combinatorics, vol 23. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04016-0_23
Download citation
DOI: https://doi.org/10.1007/978-3-642-04016-0_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04015-3
Online ISBN: 978-3-642-04016-0
eBook Packages: Springer Book Archive