Skip to main content
SpringerLink
Log in

A Bound on the Total Chromatic Number

  • Original Paper
  • Published:
Combinatorica Aims and scope Submit manuscript

. The proof is probabilistic.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and 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

  • Issue Date:

  • DOI: https://doi.org/10.1007/PL00009820

Search

Navigation