Skip to main content
SpringerLink
Log in
Book cover

Graph Colouring and the Probabilistic Method pp 265–283Cite as

The Asymptotics of Edge Colouring Multigraphs

  • Chapter

  • 1353 Accesses

Part of the book series: Algorithms and Combinatorics ((AC,volume 23))

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)⌉).

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   119.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD   159.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Toronto, 10 King’s College Road, M5S 3G4, Toronto, Ontario, Canada

    Michael Molloy

  2. Université de Paris VI, CNRS, 4, Place Jussieu, 75252, Paris Cedex 05, France

    Bruce Reed

  3. School of Computer Science, McGill University, 3480 University Avenue, H3A 2A7, Montreal, Quebec, Canada

    Bruce Reed

Authors
  1. Michael Molloy
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bruce Reed
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation