Skip to main content
SpringerLink
Log in

On Coloring of Sparse Graphs

  • Conference paper
Computer Science – Theory and Applications (CSR 2013)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7913))

Included in the following conference series:

Abstract

Graph coloring has numerous applications and is a well-known NP-complete problem. The goal of this paper is to survey recent results of the authors on coloring and improper coloring of sparse graphs and to point out some polynomial-time algorithms for coloring (not necessarily optimal) of graphs with bounded maximum average degree.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Borodin, O.V., Ivanova, A.O.: Near-proper vertex 2-colorings of sparse graphs. Diskretn. Anal. Issled. Oper. 16(2), 16–20 (2009) (in Russian); Translated in: Journal of Applied and Industrial Mathematics 4(1), 21–23 (2010)

    Google Scholar 

  2. Borodin, O.V., Ivanova, A.O.: List strong linear 2-arboricity of sparse graphs. J. Graph Theory 67(2), 83–90 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  3. Borodin, O.V., Ivanova, A.O., Montassier, M., Ochem, P., Raspaud, A.: Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k. J. Graph Theory 65, 83–93 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  4. Borodin, O.V., Ivanova, A.O., Montassier, M., Raspaud, A. (k,j)-Coloring of sparse graphs. Discrete Applied Mathematics 159(17), 1947–1953 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  5. Borodin, O.V., Ivanova, A.O., Montassier, M., Raspaud, A.: (k,1)-Coloring of sparse graphs. Discrete Math 312(6), 1128–1135 (2012)

    Google Scholar 

  6. Borodin, O.V., Kostochka, A.V.: Vertex partitions of sparse graphs into an independent vertex set and subgraph of maximum degree at most one (Russian). Sibirsk. Mat. Zh. 52(5), 1004–1010 (2011); Translation in: Siberian Mathematical Journal 52(5), 796–801

    Google Scholar 

  7. Borodin, O.V., Kostochka, A.V.: Defective 2-colorings of sparse graphs (submitted)

    Google Scholar 

  8. Borodin, O.V., Kostochka, A.V., Lidický, B., Yancey, M.: Short proofs of coloring theorems on planar graphs (submitted)

    Google Scholar 

  9. Borodin, O.V., Kostochka, A.V., Yancey, M.: On 1-improper 2-coloring of sparse graphs (submitted)

    Google Scholar 

  10. Corrěa, R., Havet, F., Sereni, J.-S.: About a Brooks-type theorem for improper colouring. Australas. J. Combin. 43, 219–230 (2009)

    MathSciNet  MATH  Google Scholar 

  11. Brooks, R.L.: On colouring the nodes of a network. Math. Proc. Cambridge Philos. Soc. 37, 194–197 (1941)

    Article  MathSciNet  Google Scholar 

  12. Dirac, G.A.: Note on the colouring of graphs. Math. Z. 54, 347–353 (1951)

    Article  MathSciNet  MATH  Google Scholar 

  13. Dirac, G.A.: A property of 4-chromatic graphs and some remarks on critical graphs. J. London Math. Soc. 27, 85–92 (1952)

    Article  MathSciNet  MATH  Google Scholar 

  14. Dirac, G.A.: Some theorems on abstract graphs. Proc. London Math. 3(2), 69–81 (1952)

    Article  Google Scholar 

  15. Dirac, G.A.: Map colour theorems related to the Heawood colour formula. J. London Math. Soc. 31, 460–471 (1956)

    Article  MathSciNet  MATH  Google Scholar 

  16. Dirac, G.A.: A theorem of R. L. Brooks and a conjecture of H. Hadwiger. Proc. London Math. Soc. 7(3), 161–195 (1957)

    Article  MathSciNet  MATH  Google Scholar 

  17. Dirac, G.A.: The number of edges in critical graphs. J. Reine Angew. Math. 268(269), 150–164 (1974)

    MathSciNet  Google Scholar 

  18. Dorbec, P., Kaiser, T., Montassier, M., Raspaud, A.: Limits of near-coloring of sparse graphs. To Appear in J. Graph Theory

    Google Scholar 

  19. Esperet, L., Montassier, M., Ochem, P., Pinlou, A.: A Complexity Dichotomy for the Coloring of Sparse Graphs. To Appear in J. Graph Theory

    Google Scholar 

  20. Farzad, B., Molloy, M.: On the edge-density of 4-critical graphs. Combinatorica 29, 665–689 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  21. Gallai, T.: Kritische Graphen I. Publ. Math. Inst. Hungar. Acad. Sci. 8, 165–192 (1963)

    MathSciNet  MATH  Google Scholar 

  22. Gallai, T.: Kritische Graphen II. Publ. Math. Inst. Hungar. Acad. Sci. 8, 373–395 (1963)

    MathSciNet  Google Scholar 

  23. Glebov, A.N., Zambalaeva, D.Z.: Path partitions of planar graphs. Sib. Elektron. Mat. Izv. 4, 450–459 (2007) (Russian)

    MathSciNet  MATH  Google Scholar 

  24. Grötzsch, H.: Zur Theorie der diskreten Gebilde. VII. Ein Dreifarbensatz für dreikreisfreie Netze auf der Kugel. Wiss. Z. Martin-Luther-Univ. Halle-Wittenberg. Math.-Nat. Reihe 8, 109–120 (1958/1959) (in Russian)

    Google Scholar 

  25. Havet, F., Sereni, J.-S.: Channel assignment and improper choosability of graphs. In: Kratsch, D. (ed.) WG 2005. LNCS, vol. 3787, pp. 81–90. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  26. Jensen, T., Thomassen, C.: The color space of a graph. J. Graph Theory 34, 234–245 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  27. Jensen, T.R., Toft, B.: Graph Coloring Problems. Wiley-Interscience Series in Discrete Mathematics and Optimization. John Wiley & Sons, New York (1995)

    MATH  Google Scholar 

  28. Jensen, T.R., Toft, B.: 25 pretty graph colouring problems. Discrete Math 229, 167–169 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  29. Karp, R.: Reducibility among combinatorial problems. In: Complexity of Computer Computations, pp. 85–103 (1972)

    Google Scholar 

  30. Kostochka, A.V., Stiebitz, M.: Excess in colour-critical graphs. In: Graph Theory and Combinatorial Biology, Balatonlelle, Hungary (1996); Bolyai Society, Mathematical Studies, Budapest, vol. 7, pp. 87–99 (1999)

    Google Scholar 

  31. Kostochka, A.V., Stiebitz, M.: A new lower bound on the number of edges in colour-critical graphs and hypergraphs. Journal of Combinatorial Theory, Series B 87, 374–402 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  32. Kostochka, A.V., Yancey, M.: Ore’s Conjecture on color-critical graphs is almost true (submitted)

    Google Scholar 

  33. Kostochka, A.V., Yancey, M.: Ore’s Conjecture for k = 4 and Grötzsch Theorem. Combinatorica (accepted)

    Google Scholar 

  34. Kostochka, A.V., Yancey, M.: A Brooks-type result for sparse critical graphs (submitted)

    Google Scholar 

  35. Krivelevich, M.: On the minimal number of edges in color-critical graphs. Combinatorica 17, 401–426 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  36. Kurek, A., Rucin’ski, A.: Globally sparse vertex-Ramsey graphs. J. Graph Theory 18, 73–81 (1994)

    MathSciNet  MATH  Google Scholar 

  37. Ore, O.: The Four Color Problem. Academic Press, New York (1967)

    MATH  Google Scholar 

  38. Thomas, R., Walls, B.: Three-coloring Klein bottle graphs of girth five. J. Combin. Theory Ser. B 92, 115–135 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  39. Thomassen, C.: A short list color proof of Grötzsch’s theorem. J. Combin. Theory Ser. B 88, 189–192 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  40. Toft, B.: Color-critical graphs and hypergraphs. J. Combin. Theory 16, 145–161 (1974)

    Article  MathSciNet  MATH  Google Scholar 

  41. Toft, B.: 75 graph-colouring problems. In: Keynes, M. (ed.) Graph Colourings, pp. 9–35 (1988) Pitman Res. Notes Math. Ser., vol. 218. Longman Sci. Tech., Harlow (1990)

    Google Scholar 

  42. Tuza, Z.: Graph coloring. In: Gross, J.L., Yellen, J. (eds.) Handbook of Graph Theory, xiv+1167 pp. CRC Press, Boca Raton (2004)

    Google Scholar 

  43. Zuckerman, D.: Linear degree extractors and the inapproximability of Max Clique and Chromatic Number. Theory of Computing 3, 103–128 (2007)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Illinois at Urbana–Champaign, Urbana, IL, 61801, USA

    Alexandr Kostochka & Matthew Yancey

  2. Sobolev Institute of Mathematics, Novosibirsk, 630090, Russia

    Alexandr Kostochka

Authors
  1. Alexandr Kostochka
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Matthew Yancey
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computing Science, Simon Fraser University, 8888 University Drive, V5A 1S6, Burnaby, BC, Canada

    Andrei A. Bulatov

  2. Institute of Mathematics and Computer Science, Ural Federal University, 51 Lenina Ave., 620083, Ekaterinburg, Russia

    Arseny M. Shur

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kostochka, A., Yancey, M. (2013). On Coloring of Sparse Graphs. In: Bulatov, A.A., Shur, A.M. (eds) Computer Science – Theory and Applications. CSR 2013. Lecture Notes in Computer Science, vol 7913. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38536-0_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-38536-0_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-38535-3

  • Online ISBN: 978-3-642-38536-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation