Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Colouring graphs whose chromatic number is almost their maximum degree

  • Conference paper
  • First Online:
LATIN'98: Theoretical Informatics (LATIN 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1380))

Included in the following conference series:

Abstract

We present efficient algorithms for determining if the chromatic number of an input graph is close to δ. Our results are obtained via the probabilistic method.

This work was supported by NATO Collaborative Research Grant #CRG950235. The work of the first author is supported by an NSERC Research Grant. The work of the second author was partially supported by a FAPESP grant.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. N. Alon and J. Spencer, The Probabilistic Method. Wiley (1992).

    Google Scholar 

  2. K. Azuma, Weighted sums of certain dependent random variables. Tokuku Math. Journal 19 (1967), 357–367.

    MATH  MathSciNet  Google Scholar 

  3. R.L. Brooks, On colouring the nodes of a network, Proc. Cambridge Phil. Soc. 37 (1941), 194–197.

    Article  MATH  MathSciNet  Google Scholar 

  4. T. Emden-Weinert, S. Hougardy, and B. Kreuter, Uniquely colourable graphs and the hardness of colouring graphs with large girth, Probability, Combinatorics, and Computing, to appear.

    Google Scholar 

  5. P. Erdós and L. Lovász, Problems and results on 3-chromatic hypergraphs and some related questions, in: “Infinite and Finite Sets” (A. Hajnal et. al. Eds), Colloq. Math. Soc. J. Bolyai 11, North Holland, Amsterdam, 1975, 609–627.

    Google Scholar 

  6. R. Karp, Reducibility among combinatorial problems, In Complexity of Computer Computations, Plenum Press (1972), 85–103.

    Google Scholar 

  7. F. Maffray and M. Preissmann, On the NP-completeness of the k-colourability problem for triangle-free graphs, Discrete Mathematics 162 (1996), 313–317.

    Article  MathSciNet  MATH  Google Scholar 

  8. M. Molloy and B. Reed, A bound on the strong chromatic index of a graph, Journal of Combinatorial Theory (B), to appear.

    Google Scholar 

  9. M. Molloy and B. Reed, A bound on the total chromatic number, submitted.

    Google Scholar 

  10. M. Molloy and B. Reed, Assymptotically better list colourings, manuscript.

    Google Scholar 

  11. M. Molloy and B. Reed, An algorithmic version of the Lovasz Local Lemma, in preparation.

    Google Scholar 

  12. M. Molloy and B. Reed, Graph Colouring via the Probabilistic Method, to appear in a book edited by A. Gyarfas and L. Lovasz.

    Google Scholar 

  13. B. Reed, χ, δ and Ω, Journal of Graph Theory, to appear.

    Google Scholar 

  14. B. Reed, A strengthening of Brook's Theorem, in preparation.

    Google Scholar 

  15. M. Talagrand, Concentration of measure and isoperimetric inequalities in product spaces. Institut Des Hautes études Scientifiques, Publications Mathématiques 81 (1995), 73–205.

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, University of Toronto, Toronto, Canada

    Michael Molloy

  2. CNRS, Paris, France

    Bruce Reed

  3. IME, USP, SÃo Paulo, Brazil

    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

Editor information

Cláudio L. Lucchesi Arnaldo V. Moura

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Molloy, M., Reed, B. (1998). Colouring graphs whose chromatic number is almost their maximum degree. In: Lucchesi, C.L., Moura, A.V. (eds) LATIN'98: Theoretical Informatics. LATIN 1998. Lecture Notes in Computer Science, vol 1380. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0054323

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64275-6

  • Online ISBN: 978-3-540-69715-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation