Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top
Published in:
Colouring Preliminaries Read chapter Read first chapter

2002 | OriginalPaper | Chapter

Near Optimal Total Colouring I: Sparse Graphs

Authors : Michael Molloy, Bruce Reed

Published in: Graph Colouring and the Probabilistic Method

Publisher: Springer Berlin Heidelberg

Included in: Professional Book Archive

Get Access

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

In the next two chapters, we present the main result of [119]:Theorem 17.1There exists an absolute constant C such that every graph with maximum degree ∈ has total chromatic number at most ∈ + C.

previous chapter ω, Δ and χ
next chapter Near Optimal Total Colouring II: General Graphs
Metadata
Title
Near Optimal Total Colouring I: Sparse Graphs
Authors
Michael Molloy
Bruce Reed
Copyright Year
2002
Publisher
Springer Berlin Heidelberg
Book
Graph Colouring and the Probabilistic Method

Print ISBN: 978-3-642-04015-3

Electronic ISBN: 978-3-642-04016-0

Copyright Year: 2002

DOI
https://doi.org/10.1007/978-3-642-04016-0_17