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.
Mathematics Subject Classification
Keywords
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
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)
Borodin, O.V., Ivanova, A.O.: List strong linear 2-arboricity of sparse graphs. J. Graph Theory 67(2), 83–90 (2011)
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)
Borodin, O.V., Ivanova, A.O., Montassier, M., Raspaud, A. (k,j)-Coloring of sparse graphs. Discrete Applied Mathematics 159(17), 1947–1953 (2011)
Borodin, O.V., Ivanova, A.O., Montassier, M., Raspaud, A.: (k,1)-Coloring of sparse graphs. Discrete Math 312(6), 1128–1135 (2012)
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
Borodin, O.V., Kostochka, A.V.: Defective 2-colorings of sparse graphs (submitted)
Borodin, O.V., Kostochka, A.V., Lidický, B., Yancey, M.: Short proofs of coloring theorems on planar graphs (submitted)
Borodin, O.V., Kostochka, A.V., Yancey, M.: On 1-improper 2-coloring of sparse graphs (submitted)
Corrěa, R., Havet, F., Sereni, J.-S.: About a Brooks-type theorem for improper colouring. Australas. J. Combin. 43, 219–230 (2009)
Brooks, R.L.: On colouring the nodes of a network. Math. Proc. Cambridge Philos. Soc. 37, 194–197 (1941)
Dirac, G.A.: Note on the colouring of graphs. Math. Z. 54, 347–353 (1951)
Dirac, G.A.: A property of 4-chromatic graphs and some remarks on critical graphs. J. London Math. Soc. 27, 85–92 (1952)
Dirac, G.A.: Some theorems on abstract graphs. Proc. London Math. 3(2), 69–81 (1952)
Dirac, G.A.: Map colour theorems related to the Heawood colour formula. J. London Math. Soc. 31, 460–471 (1956)
Dirac, G.A.: A theorem of R. L. Brooks and a conjecture of H. Hadwiger. Proc. London Math. Soc. 7(3), 161–195 (1957)
Dirac, G.A.: The number of edges in critical graphs. J. Reine Angew. Math. 268(269), 150–164 (1974)
Dorbec, P., Kaiser, T., Montassier, M., Raspaud, A.: Limits of near-coloring of sparse graphs. To Appear in J. Graph Theory
Esperet, L., Montassier, M., Ochem, P., Pinlou, A.: A Complexity Dichotomy for the Coloring of Sparse Graphs. To Appear in J. Graph Theory
Farzad, B., Molloy, M.: On the edge-density of 4-critical graphs. Combinatorica 29, 665–689 (2009)
Gallai, T.: Kritische Graphen I. Publ. Math. Inst. Hungar. Acad. Sci. 8, 165–192 (1963)
Gallai, T.: Kritische Graphen II. Publ. Math. Inst. Hungar. Acad. Sci. 8, 373–395 (1963)
Glebov, A.N., Zambalaeva, D.Z.: Path partitions of planar graphs. Sib. Elektron. Mat. Izv. 4, 450–459 (2007) (Russian)
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)
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)
Jensen, T., Thomassen, C.: The color space of a graph. J. Graph Theory 34, 234–245 (2000)
Jensen, T.R., Toft, B.: Graph Coloring Problems. Wiley-Interscience Series in Discrete Mathematics and Optimization. John Wiley & Sons, New York (1995)
Jensen, T.R., Toft, B.: 25 pretty graph colouring problems. Discrete Math 229, 167–169 (2001)
Karp, R.: Reducibility among combinatorial problems. In: Complexity of Computer Computations, pp. 85–103 (1972)
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)
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)
Kostochka, A.V., Yancey, M.: Ore’s Conjecture on color-critical graphs is almost true (submitted)
Kostochka, A.V., Yancey, M.: Ore’s Conjecture for k = 4 and Grötzsch Theorem. Combinatorica (accepted)
Kostochka, A.V., Yancey, M.: A Brooks-type result for sparse critical graphs (submitted)
Krivelevich, M.: On the minimal number of edges in color-critical graphs. Combinatorica 17, 401–426 (1997)
Kurek, A., Rucin’ski, A.: Globally sparse vertex-Ramsey graphs. J. Graph Theory 18, 73–81 (1994)
Ore, O.: The Four Color Problem. Academic Press, New York (1967)
Thomas, R., Walls, B.: Three-coloring Klein bottle graphs of girth five. J. Combin. Theory Ser. B 92, 115–135 (2004)
Thomassen, C.: A short list color proof of Grötzsch’s theorem. J. Combin. Theory Ser. B 88, 189–192 (2003)
Toft, B.: Color-critical graphs and hypergraphs. J. Combin. Theory 16, 145–161 (1974)
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)
Tuza, Z.: Graph coloring. In: Gross, J.L., Yellen, J. (eds.) Handbook of Graph Theory, xiv+1167 pp. CRC Press, Boca Raton (2004)
Zuckerman, D.: Linear degree extractors and the inapproximability of Max Clique and Chromatic Number. Theory of Computing 3, 103–128 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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)