Skip to main content
Article thumbnail
Location of Repository

Bounding χ in terms of ω and ∆ for quasi-line graphs (extended abstract)

By Andrew King and Bruce Reed


Let G be a finite simple graph. Then χ(G) is its chromatic number, ∆(G) is its maximum degree, and ω(G) is its clique number. For any graph G, χ(G) ≥ ω(G). On the other hand, it is easy to see that G can be coloured greedily, one vertex at a time, with ∆(G)+1 colours. In [4], Reed considered the problem of bounding χ(G) from above by convex combination

Year: 2007
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.