Skip to main content

Some upper bounds for the total chromatic number of graphs

Part of the Lecture Notes in Mathematics book series (LNM,volume 1623)

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

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   29.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   39.95
Price excludes VAT (Canada)
  • Compact, lightweight 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.

Authors

Rights and permissions

Reprints and Permissions

Copyright information

© 1996 Springer-Verlag

About this chapter

Cite this chapter

Yap, HP. (1996). Some upper bounds for the total chromatic number of graphs. In: Total Colourings of Graphs. Lecture Notes in Mathematics, vol 1623. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0092903

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60717-5

  • Online ISBN: 978-3-540-49301-3

  • eBook Packages: Springer Book Archive