A Bound on the Total Chromatic Number

Combinatorica volume 18, pages241–280(1998)Cite this article

. The proof is probabilistic.

This is a preview of subscription content, access via your institution.

Access options

Buy single article

Instant access to the full article PDF.

US$ 39.95

Tax calculation will be finalised during checkout.

Author information

Affiliations

  1. Department of Computer Science, University of Toronto; Toronto, Canada; E-mail: molloy@cs.toronto.edu, CA

    Michael Molloy

  2. Equipe Combinatoire, CNRS, Université Pierre et Marie Curie; Paris, France; E-mail: ered@lug.ibp.fr, FR

    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

Additional information

Received: November 26, 1996

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Molloy, M., Reed, B. A Bound on the Total Chromatic Number. Combinatorica 18, 241–280 (1998). https://doi.org/10.1007/PL00009820

Download citation

  • AMS Subject Classification (1991) Classes:  05C15