Skip to main content
SpringerLink
Log in
Book cover

Handbook of Combinatorial Optimization pp 2095–2189Cite as

On Coloring Problems

  • Reference work entry
  • First Online:

Abstract

Graph coloring is an important branch in graph theory, since it has come from the famous Four-Color Problem and is of many applications in time tabling, sequencing, scheduling, coding, frequency channel assignment, and other practical problems. Since this area includes quite a number of subjects and there exist too many interesting problems, only several interested subjects are selected in this chapter. An introduction of concepts and symbols on graph coloring is given in Sect. 1. Section 2 is devoted to discussing the classical vertex-coloring problem, involving the general upper bound of the vertex chromatic number, and the colorability and choosability of planar graphs and graphs embeddable in a surface. Section 3 investigates the acyclic vertex coloring and acyclic edge coloring of graphs as well their as various generalizations such as star coloring, linear coloring, and acyclic improper coloring. Section 4 focus on some recent progresses on vertex-distinguishing edge-weighting problems. Two types of edge-weighting, that is, proper edge-weighting and non-proper edge-weighting, are mentioned respectively. The L(p, q)-labeling problem of graphs will be finally investigated in Sect. 5, including the L(2, 1)-labeling, the coloring of the square of a graph, the injective coloring, the backbone coloring, and the (d, 1)-total labeling. In each section, a somewhat detailed survey on the recent advance of the related direction and some open problems are provided.

This is a preview of subscription content, 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   3,400.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD   549.99
Price excludes VAT (USA)
  • Durable hardcover 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

Learn about institutional subscriptions

References

  1. H.L. Abbott, B. Zhou, On small faces in 4-critical graphs. Ars Combin. 32, 203–207 (1991)

    MathSciNet  MATH  Google Scholar 

  2. L. Addario-Berry, R.E.L. Aldred, K. Dalal, B.A. Reed, Vertex colouring edge partitions. J. Combin. Theory Ser. B 94, 237–244 (2005)

    MathSciNet  MATH  Google Scholar 

  3. L. Addario-Berry, K. Dalal, C. McDiarmid, B.A. Reed, A. Thomason, Vertex-colouring edge-weightings. Combinatorica 27, 1–12 (2007)

    MathSciNet  MATH  Google Scholar 

  4. L. Addario-Berry, K. Dalal, B.A. Reed, Degree constrained subgraphs. Discrete Appl. Math. 156, 1168–1174 (2008)

    MathSciNet  MATH  Google Scholar 

  5. L. Addario-Berry, L. Esperet, R.J. Kang, C.J.H. McDiarmid, Acyclic improper colourings of graphs with bounded maximum degree. Discrete Math. 310, 223–229 (2010)

    MathSciNet  MATH  Google Scholar 

  6. G. Agnarsson, M.M. Halldórsson, Coloring powers of planar graphs. SIAM J. Discrete Math. 16, 651–662 (2003)

    MathSciNet  MATH  Google Scholar 

  7. G. Aganarsson, M.M. Halldórsson, Vertex coloring the square of outerplanar graphs of lower degree. Discuss. Math. Graph Theory 30, 619–636 (2010)

    MathSciNet  Google Scholar 

  8. M. Aigner, E. Triesch, Irregular assignments of trees and forests. SIAM J. Discrete Math. 3, 439–449 (1990)

    MathSciNet  MATH  Google Scholar 

  9. M. Aigner, E. Triesch, Z. Tuza, Irregular assignments and vertex distinguishing edge-colorings of graphs. Ann. Discrete Math. 52, 1–9 (1992)

    MathSciNet  Google Scholar 

  10. S. Akbari, H. Bidkhori, N. Nosrati, r-Strong edge colorings of graphs. Discrete Math. 306, 3005–3010 (2006)

    MathSciNet  MATH  Google Scholar 

  11. V.A. Aksionov, L.S. Mel’nikov, Some counterexamples associated with the Three Color Problem. J. Combin. Theory Ser. B 28, 1–9 (1980)

    MathSciNet  MATH  Google Scholar 

  12. M.O. Albertson, D.M. Berman, Every planar graph has an acyclic 7-coloring. Israel J. Math. 28, 169–174 (1977)

    MathSciNet  MATH  Google Scholar 

  13. M.O. Albertson, G.G. Chappell, H.A. Kierstead, A. Kündgen, R. Ramamurthi, Coloring with no 2-colored P 4’s. Electron. J. Combin. 11(1), #R26 (2004)

    Google Scholar 

  14. M.O. Albertson, J.P. Hutchinson, The three excluded cases of Dirac’s map-color theorem. Ann. N Y Acad. Sci. 319, 7–17 (1979)

    MathSciNet  Google Scholar 

  15. M.O. Albertson, J.P. Hutchinson, Hadwiger’s conjecture for graphs on the Klein bottle. Discrete Math. 29, 1–11 (1980)

    MathSciNet  Google Scholar 

  16. M.O. Albertson, W. Stromquist, Locally planar toroidal graphs are 5-colorable. Proc. Am. Math. Soc. 84, 449–456 (1982)

    MathSciNet  MATH  Google Scholar 

  17. N. Alon, C. McDiarmid, B. Reed, Acyclic colourings of graphs. Random Struct. Algorithms 2, 277–288 (1990)

    MathSciNet  Google Scholar 

  18. N. Alon, B. Mohar, D.P. Sanders, On acyclic colorings of graphs on surfaces. Israel J. Math. 94, 273–283 (1996)

    MathSciNet  MATH  Google Scholar 

  19. N. Alon, B. Sudakov, A. Zaks, Acyclic edge colorings of graphs. J. Graph Theory 37, 157–167 (2001)

    MathSciNet  MATH  Google Scholar 

  20. N. Alon, M. Tarsi, Colorings and orientations of graphs. Combinatorica 12, 125–134 (1992)

    MathSciNet  MATH  Google Scholar 

  21. N. Alon, A. Zaks, Algorithmic aspects of acyclic edge coloring. Algorithmica 32, 611–614 (2002)

    MathSciNet  MATH  Google Scholar 

  22. A. Altshuler, Construction and enumeration of regular maps on the torus. Discrete Math. 4, 201–217 (1973)

    MathSciNet  MATH  Google Scholar 

  23. D. Amar, Irregularity strength of regular graphs of large degree. Discrete Math. 114, 9–17 (1993)

    MathSciNet  MATH  Google Scholar 

  24. D. Amar, O. Togni, Irregularity strength of trees. Discrete Math. 190, 15–38 (1998)

    MathSciNet  MATH  Google Scholar 

  25. P. Angelini, F. Frati, Acyclically 3-colorable planar graphs. J. Comb. Optim. (2011). doi:10.1007/s10878-011-9385-3

    Google Scholar 

  26. M. Anholcer, M. Kalkowski, J. Przybyło, A new upper bound for the total vertex irregularity strength of graphs. Discrete Math. 309, 6316–6317 (2009)

    MathSciNet  MATH  Google Scholar 

  27. K. Appel, W. Haken, The existence of unavoidable sets of geographically good configurations. Illinois J. Math. 20, 218–297 (1976)

    MathSciNet  MATH  Google Scholar 

  28. P.N. Balister, Vertex-distinguishing edge colorings of random graphs. Random Struct. Algorithms 20, 89–97 (2001)

    MathSciNet  Google Scholar 

  29. P.N. Balister, B. Bollobás, R.H. Schelp, Vertex distinguishing colorings of graphs with Δ(G) = 2. Discrete Math. 252, 17–29 (2002)

    MathSciNet  MATH  Google Scholar 

  30. P.N. Balister, E. Győri, J. Lehel, R.H. Schelp, Adjacent vertex distinguishing edge-colorings. SIAM J. Discrete Math. 21, 237–250 (2007)

    MathSciNet  MATH  Google Scholar 

  31. P.N. Balister, A. Kostochka, H. Li, R.H. Schelp, Balanced edge colorings. J. Combin. Theory Ser. B 90, 3–20 (2004)

    MathSciNet  MATH  Google Scholar 

  32. P.N. Balister, O.M. Riordan, R.H. Schelp, Vertex-distinguishing edge colorings of graphs. J. Graph Theory 42, 95–109 (2003)

    MathSciNet  MATH  Google Scholar 

  33. J.-L. Baril, H. Kheddouci, O. Togni, The irregularity strength of circulant graphs. Discrete Math. 304, 1–10 (2005)

    MathSciNet  MATH  Google Scholar 

  34. T. Bartnicki, J. Grytczuk, S. Niwczyk, Weight choosability of graphs. J. Graph Theory 60, 242–256 (2009)

    MathSciNet  MATH  Google Scholar 

  35. M. Basavaraju, L.S. Chandran, Acyclic edge coloring of subcubic graphs. Discrete Math. 308, 6650–6653 (2008)

    MathSciNet  MATH  Google Scholar 

  36. M. Basavaraju, L.S. Chandran, Acyclic edge coloring of graphs with maximum degree 4. J. Graph Theory 61, 192–209 (2009)

    MathSciNet  MATH  Google Scholar 

  37. M. Basavaraju, L.S. Chandran, A note on acyclic edge coloring of complete bipartite graphs. Discrete Math. 309, 4646–4648 (2009)

    MathSciNet  MATH  Google Scholar 

  38. M. Basavaraju, L.S. Chandran, Acyclic edge coloring of 2-degenerate graphs. J. Graph Theory 69, 1–27 (2012)

    MathSciNet  MATH  Google Scholar 

  39. M. Basavaraju, L.S. Chandran, N. Cohen, F. Havet, T. Müller, Acyclic edge-coloring of planar graphs. SIAM J. Discrete Math. 25, 463–478 (2011)

    MathSciNet  MATH  Google Scholar 

  40. M. Basavaraju, L.S. Chandran, Acyclic edge coloring of triangle free planar graphs. arXiv.org/abs/1007.2282v1.

    Google Scholar 

  41. M. Basavaraju, L.S. Chandran, M. Kummini, d-Regular graphs of acyclic chromatic index at least d + 2. J. Graph Theory 63, 226–230 (2010)

    MathSciNet  MATH  Google Scholar 

  42. C. Bazgan, A. Harkat-Benhamdine, H. Li, M. Woźniak, On the vertex-distinguishing proper edge-colorings of graphs. J. Combin. Theory Ser. B 75, 288–301 (1999)

    MathSciNet  MATH  Google Scholar 

  43. C. Bazgan, A. Harkat-Benhamdine, H. Li, M. Woźniak, A note on the vertex-distinguishing proper colorings of graphs with large minimum degree. Discrete Math. 236, 37–42 (2001)

    MathSciNet  MATH  Google Scholar 

  44. F. Bazzaro, M. Montassier, A. Raspaud, (d, 1)-Total labelling of planar graphs with large girth and high maximum degree. Discrete Math. 307, 2141–2151 (2007)

    MathSciNet  MATH  Google Scholar 

  45. J. Beck, An algorithmic approach to the Lov\acute{a}sz local lemma. Random Struct. Algorithms 2, 343–365 (1991)

    MATH  Google Scholar 

  46. M. Behzad, Graphs and their chromatic number. Doctoral Thesis, Michigan State University, 1965

    Google Scholar 

  47. P. Bella, D. Král, B. Mohar, K. Quitterová, Labelling planar graphs with a condition at distance two. Eur. J. Combin. 28, 2201–2239 (2007)

    MATH  Google Scholar 

  48. C. Berge, Perfect graphs, in Six Papers on Graph Theory (Indian Statistical Institute, Calcutta, 1963), pp. 1–21

    Google Scholar 

  49. X. Bian, L. Miao, H. Shang, C. Duan, G. Ma, Adjacent vertex-distinguishing edge partition of graphs. J. East China Norm. Univ. Nat. Sci. Ed. 2009(4), 16–20 (2009)

    MathSciNet  Google Scholar 

  50. H.L. Bodlaender, T. Kloks, R.B. Tan, J.V. Leeuwen, λ-Coloring of graphs. Lect. Notes Comput. Sci. 1770, 395–406 (2000)

    Google Scholar 

  51. H.L. Bodlaender, T. Kloks, R.B. Tan, J.V. Leeuwen, Approximations for λ-colorings of graphs. Comput. J. 47, 193–204 (2004)

    MATH  Google Scholar 

  52. T. Bohman. D. Kravitz, On the irregularity strength of trees. J. Graph Theory 45, 241–254 (2004)

    MathSciNet  MATH  Google Scholar 

  53. T. Böhme, B. Mohar, M. Stiebitz, Dirac’s map-color theorem for choosability. J. Graph Theory 32, 327–339 (1999)

    MathSciNet  MATH  Google Scholar 

  54. P. Boiron, E. Sopena, L. Vignal, Acyclic improper colorings of graphs. J. Graph Theory 32, 97–107 (1999)

    MathSciNet  MATH  Google Scholar 

  55. O.V. Borodin, On acyclic coloring of planar graphs. Discrete Math. 25, 211–236 (1979)

    MathSciNet  MATH  Google Scholar 

  56. O.V. Borodin, On the total coloring of planar graphs. J. Reine Angew. Math. 394, 180–185 (1989)

    MathSciNet  MATH  Google Scholar 

  57. O.V. Borodin, Structural properties of plane graphs without adjacent triangles and an application to 3-colorings. J. Graph Theory 21, 183–186 (1996)

    MathSciNet  MATH  Google Scholar 

  58. O.V. Borodin, Acyclic 3-choosability of planar graphs with no cycles with length from 4 to 12. Diskretn. Anal. Issled. Oper. 116(5), 26–33 (2009) (in Russian)

    Google Scholar 

  59. O.V. Borodin, Acyclic 4-colorability of planar graphs without 4- and 5-cycles. Diskretn. Anal. Issled. Oper. 17(2), 20–38 (2010) (in Russian)

    MATH  Google Scholar 

  60. O.V. Borodin, H.J. Broersma, A. Glebov, J.V.D. Heuvel, Stars and bunches in planar graphs. Part II: General planar graphs and colourings. CDAM researches report 2002-05, 2002

    Google Scholar 

  61. O.V. Borodin, M. Chen, A.O. Ivanova, A. Raspaud, Acyclic 3-choosability of sparse graphs with girth at least 7. Discrete Math. 310, 2426–2434 (2010)

    MathSciNet  MATH  Google Scholar 

  62. O.V. Borodin, D.G. Fon-Der Flaass, A.V. Kostochka, A. Raspaud, E. Sopena, Acyclic list 7-coloring of planar graphs. J. Graph Theory 40, 83–90 (2002)

    MathSciNet  MATH  Google Scholar 

  63. O.V. Borodin, A.N. Glebov, A.O. Ivanova, T.K. Neustroeva, V.A. Tashkinov, Sufficient conditions for the 2-distance (Δ+1)-colorability of plane graphs. Sib. Elektron. Mat. Izv. 1, 129–141 (2004) (in Russian)

    MathSciNet  MATH  Google Scholar 

  64. O.V. Borodin, A.N. Glebov, M. Montassier, A. Raspaud, Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable. J. Combin. Theory Ser. B 99, 668–673 (2009)

    MathSciNet  MATH  Google Scholar 

  65. O.V. Borodin, A.N. Glebov, A. Raspaud, M.R. Salavatipour, Planar graphs without cycles of length from 4 to 7 are 3-colorable. J. Combin. Theory Ser. B 93, 303–311 (2005)

    MathSciNet  MATH  Google Scholar 

  66. O.V. Borodin, A.O. Ivanova, Planar graphs without triangular 4-cycles are 4-choosable. Sib. Elektron. Mat. Izv. 5, 75–79 (2008)

    MathSciNet  Google Scholar 

  67. O.V. Borodin, A.O. Ivanova, Acyclic 5-choosability of planar graphs without adjacent short cycles. J. Graph Theory 68, 169–176 (2011)

    MathSciNet  MATH  Google Scholar 

  68. O. V. Borodin, A. O. Ivanova, Acyclic 5-choosability of planar graphs without 4-cycles. Siberian Math. J. 52, 411–425 (2011)

    MathSciNet  MATH  Google Scholar 

  69. O.V. Borodin, A.O. Ivanova, 2-Distance (Δ + 2)-coloring of planar graphs with girth six and Δ ≥ 18. Discrete Math. 309, 6496–6502 (2009)

    MathSciNet  MATH  Google Scholar 

  70. O.V. Borodin, A.O. Ivanova, List 2-distance (Δ + 2)-coloring of planar graphs with girth six. Eur. J. Combin. 30, 1257–1262 (2009)

    MathSciNet  MATH  Google Scholar 

  71. O.V. Borodin, A.O. Ivanova, Acyclic 4-choosability of planar graphs with no 4- and 5-cycles J. Graph Theory, 72, 374–397 (2013)

    MathSciNet  MATH  Google Scholar 

  72. O.V. Borodin, A.O. Ivanova, List injective colorings of planar graphs. Discrete Math. 311, 154–165 (2011)

    MathSciNet  MATH  Google Scholar 

  73. O.V. Borodin, A.O. Ivanova, T.K. Neustroeva, List 2-distance (Δ + 1)-coloring of planar graphs with given girth. J. Appl. Ind. Math. 2, 317–328 (2008)

    MathSciNet  Google Scholar 

  74. O.V. Borodin, A.O. Ivanova, A. Raspaud, Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles. Discrete Math. 310, 2946–2950 (2010)

    MathSciNet  MATH  Google Scholar 

  75. O.V. Borodin, A.V. Kostochka, On an upper bound of the graphs’s chromatic number depending on the graph’s degree and density. J. Combin. Theory Ser. B 23, 247–250 (1977)

    MathSciNet  MATH  Google Scholar 

  76. O.V. Borodin, A.V. Kostochka, A. Raspaud, E. Sopena, Acyclic colouring of 1-planar graphs. Discrete Appl. Math. 114, 29–41 (2001)

    MathSciNet  MATH  Google Scholar 

  77. O.V. Borodin, A.V. Kostochka, D.R. Woodall, Total colorings of planar graphs with large maximum degree. J. Graph Theory 26, 53–59 (1997)

    MathSciNet  MATH  Google Scholar 

  78. O.V. Borodin, A.V. Kostochka, D.R. Woodall, Acyclic colourings of planar graphs with large girth. J. Lond. Math. Soc. 60(2), 344–352 (1999)

    MathSciNet  Google Scholar 

  79. O.V. Borodin, M. Montassier, A. Raspaud, Planar graphs without adjacent cycles of length at most seven are 3-colorable. Discrete Math. 310, 167–173 (2010)

    MathSciNet  MATH  Google Scholar 

  80. M. Borowiecki, A. Fiedorowics, Acyclic edge colouring of planar graphs without short cycles. Discrete Math. 310, 1445–1455 (2010)

    MathSciNet  MATH  Google Scholar 

  81. H. Broersma, F.V. Fomin, P.A. Golovach, G.J. Woeginger, Backbone coloring for networks, in Proceeding of WG 2003. Lecture Notes in Computer Science, vol. 2880, (Springer, Berlin, 2003), pp. 131–142

    Google Scholar 

  82. H. Broersma, F.V. Fomin, P.A. Golovach, G.J. Woeginger, Backbone coloring for graphs: tree and path backbones. J. Graph Theory 55, 137–152 (2007)

    MathSciNet  MATH  Google Scholar 

  83. H.J. Broersma, J. Fujisawa, L. Marchal, A.N.M. Salman, K. Yoshimoto, λ-Backbone colorings along pairwise disjoint stars and matchings. Discrete Math. 309, 5596–5609 (2009)

    MathSciNet  MATH  Google Scholar 

  84. Y. Bu, D. Chen, A. Raspaud, W. Wang, Injective coloring of planar graphs. Discrete Appl. Math. 157, 663–672 (2009)

    MathSciNet  MATH  Google Scholar 

  85. Y. Bu, N.W. Cranston, M. Montassier, A. Raspaud, W. Wang, Star-coloring of sparse graphs. J. Graph Theory 62, 201–219 (2009)

    MathSciNet  MATH  Google Scholar 

  86. Y. Bu, K.-W. Lih, W. Wang, Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least six. Discuss. Math. Graph Theory 31, 429–439 (2011)

    MathSciNet  MATH  Google Scholar 

  87. Y. Bu, S. Zhang, Backbone coloring for C 4-free planar graphs. Sci. Sin. Math. 41, 197–206 (2011) (in Chinese)

    Google Scholar 

  88. A.C. Burris, Vertex-distinguishing edge-colorings. Ph.D. Dissertation, Memphis State University, 1993

    Google Scholar 

  89. A.C. Burris, R.H. Schelp, Vertex-distinguishing proper edge-coloring. J. Graph Theory 26, 73–82 (1997)

    MathSciNet  MATH  Google Scholar 

  90. M.I. Burs̆teín, Every 4-valent graph has an acyclic 5 coloring. Soobshch. Akad. Nauk Gruzin SSR 93, 21–24 (1979) (in Russian)

    MathSciNet  Google Scholar 

  91. L. Cai, W. Wang, X. Zhu, Choosability of toroidal graphs without short cycles. J. Graph Theory 65, 1–15 (2010)

    MathSciNet  MATH  Google Scholar 

  92. T. Calamoneri, The L(h, k)-labelling problem: a survey and annotated bibliography. Comput. J. 49, 585–608 (2006)

    Google Scholar 

  93. T. Calamoneri, R. Petreschi, L(h, 1)-labelling subclasses of planar graphs. J. Parallel Distrib. Comput. Math. 220, 414–426 (2003)

    Google Scholar 

  94. Y. Card, Y. Roditty, Acyclic edge-colorings of sparse graphs. Appl. Math. Lett. 7, 63–67 (1994)

    Google Scholar 

  95. P.A. Catlin, Hajós’ graph-coloring conjecture: variations and counterexamples. J. Combin. Theory Ser. B 26, 268–274 (1979)

    MathSciNet  MATH  Google Scholar 

  96. J. Černý, M. Horňák, R. Soták, Observability of a graph. Math. Slovaca 46, 21–31 (1996)

    MathSciNet  MATH  Google Scholar 

  97. G.J. Chang, W.-T. Ke, D. Kuo, D.D.-F. Liu, R.K. Yeh, On L(d, 1)-labellings of graphs. Discrete Math. 220, 57–66 (2000)

    MathSciNet  MATH  Google Scholar 

  98. G.J. Chang, D. Kuo, The L(2, 1)-labelling problem on graphs. SIAM J. Discrete Math. 9, 309–316 (1996)

    MathSciNet  MATH  Google Scholar 

  99. G.J. Chang, C. Lu, J. Wu, Q. Yu, Vertex-coloring edge-weightings of graphs. Taiwan. J. Math 15, 1807–1813 (2011)

    MathSciNet  MATH  Google Scholar 

  100. G. Chartrand, M.S. Jacobson, J. Lehel, O.R. Oellermann, S. Ruiz, F. Saba, Irregular networks. Congr. Numer. 64, 197–210 (1988)

    MathSciNet  Google Scholar 

  101. G. Chartrand, H.V. Kronk, The point-arboricity of planar graphs. J. Lond. Math. Soc. 44, 612–616 (1969)

    MathSciNet  MATH  Google Scholar 

  102. X. Chen, On the adjacent vertex distinguishing total coloring numbers of graphs with Δ = 3. Discrete Math. 308, 4003–4007 (2008)

    MathSciNet  MATH  Google Scholar 

  103. M. Chen, X. Guo, Adjacent vertex-distinguishing edge and total chromatic numbers of hypercubes. Inform. Process. Lett. 109, 599–602 (2009)

    MathSciNet  MATH  Google Scholar 

  104. M. Chen, G. Hahn, A. Raspaud, W. Wang, Some results on the injective chromatic number of graphs. J. Comb. Optim. (2011). doi:10.1007/s10878-011-9386-2

    Google Scholar 

  105. M. Chen, H. Lu, Y. Wang, A note on 3-choosability of planar graphs. Inform. Process. Lett. 105, 206–211 (2008)

    MathSciNet  MATH  Google Scholar 

  106. M. Chen, A. Raspaud, A sufficient condition for planar graphs to be acyclically 5-choosable. J. Graph Theory 70, 135–151 (2012)

    MathSciNet  MATH  Google Scholar 

  107. M. Chen, A. Raspaud, N. Roussel, X. Zhu, Acyclic 4-choosability of planar graphs. Discrete Math. 311, 92–101 (2011)

    MathSciNet  MATH  Google Scholar 

  108. M. Chen, A. Raspaud, W. Wang, Three-coloring planar graphs without short cycles. Inform. Process. Lett. 101, 134–138 (2007)

    MathSciNet  MATH  Google Scholar 

  109. D. Chen, W. Wang, The (2, 1)-total labelling of the product of two kinds of graphs. J. Zhejiang Norm. Univ. Nat. Sci. 29, 26–31 (2006)

    MATH  Google Scholar 

  110. D. Chen, W. Wang, (2, 1)-Total labelling of outerplanar graphs. Discrete Appl. Math. 155, 2585–2593 (2007)

    MathSciNet  MATH  Google Scholar 

  111. M. Chen, A. Raspaud, Planar graphs without 4- and 5-cycles are acyclically 4-choosable, Discrete Appl. Math. in press, (2013)

    Google Scholar 

  112. M. Chen, A. Raspaud, W. Wang, 6-Star-coloring of subcubic graphs. J. Graph Theory 72, 128–145 (2013)

    MathSciNet  MATH  Google Scholar 

  113. M. Chen, W. Wang, Acyclic 5-choosability of planar graphs without 4-cycles. Discrete Math. 308, 6216–6225 (2008)

    MathSciNet  MATH  Google Scholar 

  114. M. Chudnovsky, N. Robertson, P. Seymour, R. Thomas, The strong perfect graph theorem. Ann. Math. 164, 51–229 (2006)

    MathSciNet  MATH  Google Scholar 

  115. N. Cohen, F. Havet, T. Müller, Acyclic edge-colouring of planar graphs. Extended abstract. Eletron. Note Discrete Math. 34, 417–421 (2009)

    Google Scholar 

  116. T. Coker, K. Johannson, The adjacent vertex distinguishing total chromatic number. arXiv:1009.1785v2

    Google Scholar 

  117. T.F. Coleman, J. Cai, The cyclic coloring problem and estimation of sparse Hessian matrices. SIAM J. Algebraic Discrete Method 7, 221–235 (1986)

    MathSciNet  MATH  Google Scholar 

  118. K.L. Collins, J.P. Hutchinson, Four-coloring six-regular graphs on the torus. in: P. Hansen, O. Marcotte (Eds.), Graph Colouring and Applications, CRM Proceedings and Lecture Notes, 23, 21–34 (1999)

    Google Scholar 

  119. D.W. Cranston, S.-J. Kim, List-coloring the square of a subcubic graph. J. Graph Theory 57, 65–78 (2008)

    MathSciNet  MATH  Google Scholar 

  120. D.W. Cranston, S.-J. Kim, G. Yu, Injective colorings of sparse graphs. Discrete Math. 310, 2965–2973 (2010)

    MathSciNet  MATH  Google Scholar 

  121. D.W. Cranston, S.-J. Kim, G. Yu, Injective colorings of graphs with low average degree. Algorithmica 60, 553–568 (2011)

    MathSciNet  MATH  Google Scholar 

  122. B. Cuckler, F. Lazebnik, Irregularity strength of dense graphs. J. Graph Theory 58, 299–313 (2008)

    MathSciNet  MATH  Google Scholar 

  123. Y. Dai, Y. Bu, An upper bound on the adjacent vertex-distinguishing chromatic number of graph. Math. Econ. 26, 107–110 (2009)

    MathSciNet  Google Scholar 

  124. E. Dedò, D. Torri, N. Zagaglia Salvi, The observability of the Fibonacci and the Lucas cubes. Discrete Math. 255, 55–63 (2002)

    MathSciNet  MATH  Google Scholar 

  125. B. Descartes, A three colour problem. Eureka 21, 459–470 (1947)

    Google Scholar 

  126. R. Diestel, Graph Theory, 3rd ed. (Springer, Berlin, 2005)

    MATH  Google Scholar 

  127. J.H. Dinitz, D.K. Garnick, A. Gyárfás, On the irregularity strength of the m ×n grid. J. Graph Theory 16, 355–374 (1992)

    MathSciNet  MATH  Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

  130. G.A. Dirac, S. Schuster, A theorem of Kuratowski. Indag. Math. 16, 343–348 (1954)

    MathSciNet  Google Scholar 

  131. W. Dong, B. Xu, Some results on acyclic edge coloring of plane graphs. Inform. Process. Lett. 110, 887–892 (2010)

    MathSciNet  MATH  Google Scholar 

  132. W. Dong, B. Xu, X. Zhang, Improved bounds on linear coloring of plane graphs. Sci. China Ser. A Math. 53, 1895–1902 (2010)

    MathSciNet  MATH  Google Scholar 

  133. A. Doyon, G. Hahn, A. Raspaud, Some bounds on the injective chromatic number of graphs. Discrete Math. 310, 585–590 (2010)

    MathSciNet  MATH  Google Scholar 

  134. Z. Dvořák, D. Král, P. Nejedlý, R. Škrekovski, Coloring squares of planar graphs with girth six. Eur. J. Combin. 29, 838–849 (2008)

    MATH  Google Scholar 

  135. Z. Dvořák, B. Lidický, R. Škrekovski, 3-Choosability of triangle-free planar graphs with constraints on 4-cycles. SIAM J. Discrete Math. 24, 934–945 (2010)

    MathSciNet  MATH  Google Scholar 

  136. Z. Dvořák, B. Lidický, R. Škrekovski, Planar graphs without 3-, 7- and 8-cycles are 3-choosable. Discrete Math. 309, 5899–5904 (2009)

    MathSciNet  MATH  Google Scholar 

  137. N. Eaton, T. Hull, Defective list colorings of planar graphs. Bull. Inst. Combin. Appl. 25, 79–87 (1999)

    MathSciNet  MATH  Google Scholar 

  138. J.R. Edmonds, Minimum partition of a matroid into independent subsets. J. Res. Nat. Bur. Stand. 69B, 65–72 (1965)

    Google Scholar 

  139. K. Edwards, M. Horná̌k, M. Woźniak, On the neighbour distinguishing index of a graph. Graphs Combin. 22, 341–350 (2006)

    MathSciNet  MATH  Google Scholar 

  140. P. Erdős, A.L. Rubin, H. Taylor, Choosability in graphs. Congr. Numer. 26, 125–157 (1979)

    Google Scholar 

  141. L. Esperet, M. Montassier, A. Raspaud, Linear choosability of graphs. Discrete Math. 306, 3938–3950 (2008)

    MathSciNet  Google Scholar 

  142. L. Esperet, A. Pinlou, Acyclic improper choosability of outerplanar graphs. Research report RR-1405-06, LaBRI, Université Bordeaux 1, 2006

    Google Scholar 

  143. L. Esperet, A. Pinlou, Acyclic improper choosability of graphs. Electron. Note Discrete Math. 28, 251–258 (2007)

    MathSciNet  Google Scholar 

  144. B. Farzad, Planar graphs without 7-cycles are 4-choosable. SIAM J. Discrete Math. 23, 1179–1199 (2009)

    MathSciNet  MATH  Google Scholar 

  145. R.J. Faudree, J. Lehel, Bound on the irregularity strength of regular graphs. Colloq. Math. Soc. János Bolyai (North-Holland, Amsterdam) 52, 247–256 (1988)

    MathSciNet  Google Scholar 

  146. M. Ferrara, R. Gould, M. Karoński, F. Pfender, An interactive approach to graph irregularity strength. Discrete Appl. Math. 158, 1189–1194 (2010)

    MathSciNet  MATH  Google Scholar 

  147. G. Fertin, E. Godard, A. Raspaud, Acyclic and k-distance coloring of the grid. Inform. Process. Lett. 87, 51–58 (2003)

    MathSciNet  MATH  Google Scholar 

  148. G. Fertin, A. Raspaud, Acyclic colorings of graphs of maximum degree Δ(G), in European Conference on Combinatorics, Graph Theory and Applications, June 2005, pp. 389–396

    Google Scholar 

  149. G. Fertin, A. Raspaud, B. Reed, On star-coloring of graphs. Lect. Notes Comput. Sci. 2204, 140–153 (2001)

    MathSciNet  Google Scholar 

  150. J. Fiala, J. Kratochvil, On the computational complexity of the L(2, 1)-labelling problem for regular graphs. Lect. Notes Comput. Sci. 3701, 228–236 (2005)

    MathSciNet  Google Scholar 

  151. J. Fiamc̆ík, The acyclic chromatic class of a graph. Math. Slovaca 28, 139–145 (1978)

    MathSciNet  Google Scholar 

  152. J. Fiamc̆ík, Acyclic chromatic index of a graph with maximum valency three. Arch. Math. (Brno) 16, 81–87 (1980) (in Russian)

    MathSciNet  Google Scholar 

  153. A. Fiedorowicz, Acyclic edge colourings of graphs with the number of edges linearly bounded by the number of vertices. Inform. Process. Lett. 111, 287–290 (2011)

    MathSciNet  MATH  Google Scholar 

  154. A. Fiedorowics, M. Haluszczak, N. Narayanan, About acyclic edge colourings of planar graphs. Inform. Process. Lett. 108, 412–417 (2008)

    MathSciNet  Google Scholar 

  155. G. Fijavž, M. Juvan, B. Mohar, R. Škrekovski, Planar graphs without cycles of specific lengths. Eur. J. Combin. 23, 377–388 (2002)

    MATH  Google Scholar 

  156. P. Franklin, A six-color problem. J. Math. Phys. 13, 363–369 (1934)

    Google Scholar 

  157. A. Frieze, R.J. Gould, M. Karoński, F. Pfender, On graph irregularity strength. J. Graph Theory 41, 120–137 (2002)

    MathSciNet  MATH  Google Scholar 

  158. Y. Gao, D. Yu, Acyclic edge coloring of planar graphs without cycles of specific lengths. J. Appl. Math. Comput. 37, 533–540 (2011)

    MathSciNet  Google Scholar 

  159. M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, San Francisco, 1979)

    MATH  Google Scholar 

  160. M.R. Garey, D.S. Johnson, L. Stockmeyer, Some simplified NP-complete graph problems. Theoret. Comput. Sci. 1, 237–267 (1976)

    MathSciNet  MATH  Google Scholar 

  161. A.H. Gebremedhin, F. Manne, A. Pothen, What color is your Jacobian? Graph coloring for computing derivatives. SIAM Rev. 47, 629–705 (2005)

    MathSciNet  MATH  Google Scholar 

  162. A.H. Gebremedhin, A. Pothen, A. Tarafdar, A. Walther, Efficient computation of sparse Hessians using coloring and automatic differentiation. INFORMS J. Comput. 21, 209–223 (2009)

    MathSciNet  MATH  Google Scholar 

  163. S. Gerke, C. Greenhill, N. Wormald, The generalized acyclic edge chromatic number of random regular graphs. J. Graph Theory 53, 101–125 (2006)

    MathSciNet  MATH  Google Scholar 

  164. S. Gerke, M. Raemy, Generalised acyclic edge colourings of graphs with large girth. Discrete Math. 307, 1668–1671 (2007)

    MathSciNet  MATH  Google Scholar 

  165. M. Ghandehari, H. Hatami, Two upper bounds for the strong edge chromatic number. Preprint. http://citeseerx.ist.psu.edu/viewdoc/summary?doi:10.1.1.9.8996

  166. D. Gonçalves, On the L(p, 1)-labelling of graphs. Discrete Math. 308, 1405–1414 (2008)

    MathSciNet  MATH  Google Scholar 

  167. C. Greenhill, O. Pokhurko, Bounds on generalized acyclic chromatic numbers of bounded degree graphs. Graphs Combin. 21, 407–419 (2005)

    MathSciNet  MATH  Google Scholar 

  168. C. Greenhill, A. Ruciński, Neighbour-distinguishing edge colourings of random regular graphs. Electron. J. Combin. 13, #R77 (2006)

    Google Scholar 

  169. J.R. Griggs, R.K. Yeh, Labelling graphs with a condition with at distance 2. SIAM J. Discrete Math. 5, 586–595 (1992)

    MathSciNet  MATH  Google Scholar 

  170. H. Grötzsch, Ein Drefarbensatz fur dreikreisfreie Netze auf der Kugel. Wiss. Z. Martin-Luther-Univ. Halle-Wittenberg Mat-Natur. Reche. 8, 109–120 (1959)

    Google Scholar 

  171. B. Grünbaum, Acyclic colorings of planar graphs. Israel J. Math. 14, 390–408 (1973)

    MathSciNet  MATH  Google Scholar 

  172. F. Guldan, Acyclic chromatic index and linear arboricity of graphs. Math. Slovaca 41, 21–27 (1991)

    MathSciNet  MATH  Google Scholar 

  173. S. Gutner, The complexity of planar graph choosability. Discrete Math. 159, 119–130 (1996)

    MathSciNet  MATH  Google Scholar 

  174. E. Győri, M. Horňák, C. Palmer, M. Woźniak, General neighbour-distinguishing index of a graph. Discrete Math. 308, 827–831 (2008)

    MathSciNet  Google Scholar 

  175. E. Győri, C. Palmer, A new type of edge-derived vertex coloring. Discrete Math. 309, 6344–6352 (2009)

    MathSciNet  Google Scholar 

  176. G. Hajós, Über eine Konstruktion nicht n-färbbarer Graphen. Wiss. Z. Martin-Luther-Univ. Halle-Wittenberg. Math.-Nat. Reihe. 10, 116–117 (1961)

    Google Scholar 

  177. F. Harary, M. Plantholt, The point-distinguishing chromatic index, in Graphs and Application, ed. by F. Harary, J.S. Maybee (Wiley-Interscience, New York, 1985), pp. 147–162

    Google Scholar 

  178. T. Hasunumaa, T. Ishiib, H. Onoc, Y. Unod, A tight upper bound on the (2, 1)-total labeling number of outerplanar graphs. J. Discrete Algorithms, 14, 189–206 (2012)

    MathSciNet  Google Scholar 

  179. H. Hatami, Δ + 300 is a bound on the adjacent vertex distinguishing edge chromatic number. J. Combin. Theory Ser. B 95, 246–256 (2005)

    MathSciNet  MATH  Google Scholar 

  180. I. Havel, O zbarvitelnosti rovinných grafu̇ třemi barvami. Math. Geometrie Theorie Grafu̇, 89–91 (1970)

    Google Scholar 

  181. F. Havet, J.V.D. Heuvel, C. McDiarmid, B. Reed, List colouring squares of planar graphs. Electron. Note Discrete Math. 29, 515–519 (2007)

    Google Scholar 

  182. F. Havet, B. Reed, J.S. Sereni, L(2, 1)-labelling of graphs, in Proceedings of the ACM-SIAM Symposium on Discrete Algorithm (SODA 08), San Francisco, 20–22, 2008, pp. 621–630

    MathSciNet  Google Scholar 

  183. F. Havet, S. Thomassé, Complexity of (p, 1)-total labelling. Discrete Appl. Math. 157, 2859–2870 (2009)

    MathSciNet  MATH  Google Scholar 

  184. F. Havet, M.-L. Yu, (d, 1)-Total labelling of graphs. Technical report 4650, INRIA, 2002

    Google Scholar 

  185. F. Havet, M.-L. Yu, (p, 1)-Total labelling of graphs. Discrete Math. 308, 496–513 (2008)

    MathSciNet  MATH  Google Scholar 

  186. F. Havet, M.-L. Yu, Corrigendum to “(p, 1)-total labelling of Graphs”. Discrete Math. 310, 2219–2220 (2010)

    MathSciNet  MATH  Google Scholar 

  187. P.J. Heawood, Map colour theorem. Q. J. Pure Appl. Math. 24, 332–338 (1890)

    MATH  Google Scholar 

  188. P. Hell, A. Raspaud, J. Stacho, On injective colouring of chordal graphs. In LATIN2008: Theoretical informatics, Lecture Notes in Computer Science, vol. 4957 (Springer, Berlin, 2008), pp. 520–530

    Google Scholar 

  189. J.V.D. Heuvel, S. McGuiness, Coloring of the square of planar graph. J. Graph Theory 42, 110–124 (2003)

    MathSciNet  MATH  Google Scholar 

  190. H. Hind, M. Molloy, B. Reed, Colouring a graph frugally. Combinatorica 17, 469–482 (1997)

    MathSciNet  MATH  Google Scholar 

  191. H. Hind, M. Molloy, B. Reed, Total coloring with Δ+poly(logΔ) colors. SIAM J. Comput. 28, 816–821 (1999)

    MathSciNet  MATH  Google Scholar 

  192. H. Hocquard, M. Montassier, Every planar graph without cycles of length 4 to 12 is acyclically 3-choosable. Inform. Process. Lett. 109, 1193–1196 (2009)

    MathSciNet  MATH  Google Scholar 

  193. H. Hocquard, M. Montassier, Acyclic coloring of graphs with maximum degree five, 2010. http://hal.archives-ouvertes.fr/hal-00375166/fr/

  194. H. Hocquard, M. Montassier, A. Raspaud, A note on the acyclic 3-choosability of some planar graphs. Discrete Appl. Math. 158, 1104–1110 (2010)

    MathSciNet  MATH  Google Scholar 

  195. M. Horňák, R. Soták, Observability of complete multipartite graphs with equipotent parts. Ars Combin. 41, 289–301 (1995)

    MathSciNet  MATH  Google Scholar 

  196. M. Horňák, R. Soták, The fifth jump of the point-distinguishing chromatic index of K n, n . Ars Combin. 42, 233–242 (1996)

    MathSciNet  MATH  Google Scholar 

  197. M. Horňák, R. Soták, Asymptotic behaviour of the observability of Q n . Discrete Math. 176, 139–148 (1997)

    MathSciNet  MATH  Google Scholar 

  198. M. Horňák, R. Soták, Localization of jumps of the point-distinguishing chromatic index of K n, n . Discuss. Math. Graph Theory 17, 243–251 (1997)

    MathSciNet  MATH  Google Scholar 

  199. M. Horňák, R. Soták, General neighbour-distinguishing index via chromatic number. Discrete Math. 310, 1733–1736 (2010)

    MathSciNet  MATH  Google Scholar 

  200. M. Horňák, N. Zagaglia Salvi, On the point-distinguishing chromatic index of complete bipartite graphs. Ars Combin. 80, 75–85 (2006)

    MathSciNet  MATH  Google Scholar 

  201. J. Hou, Some topics on restricted coloring problems of graphs. Ph.D. Dissertation, Shandong University, Jinan, 2009

    Google Scholar 

  202. J. Hou, J. Wu, G. Liu, B. Liu, Acyclic edge colorings of planar graphs and series-parallel graphs. Sci. China Ser. A Math. 52, 605–616 (2009)

    MathSciNet  MATH  Google Scholar 

  203. J. Hou, J. Wu, G. Liu, B. Liu, Acyclic edge chromatic number of outerplanar graphs, J. Graph Theory 64, 22–36 (2010)

    MathSciNet  MATH  Google Scholar 

  204. J. Hou, Y. Zhu, G. Liu, J. Wu, M. Lan, Total colorings of planar graphs without small cycles. Graphs Combin. 24, 91–100 (2008)

    MathSciNet  MATH  Google Scholar 

  205. J. Huang, H. Sun, W. Wang, D. Chen, (2,1)-Total labelling of trees with spares vertices of maximum degree. Inform. Proc. Lett. 109, 119–203 (2009)

    MathSciNet  Google Scholar 

  206. D. Hudák, F. Kardö, B. Lužar, R. Soták, R. Škrekovski, Acyclic edge coloring planar graphs with Δ colors. Discrete Appl. Math. 160, 1356–1368 (2012)

    MathSciNet  MATH  Google Scholar 

  207. J. Hulgan, Concise proofs for adjacent vertex-distinguishing total colorings. Discrete Math. 309, 2548–2550 (2009)

    MathSciNet  MATH  Google Scholar 

  208. J.P. Hutchinson, B. Richter, P. Seymour, Coloring eulerian triangulations. J. Combin. Theory Ser. B 84, 225–239 (2002)

    MathSciNet  MATH  Google Scholar 

  209. R.E. Jamison, G.L. Matthews, Acyclic colorings of products of cycles. Bull. Inst. Combin. Appl. 54, 59–76 (2008)

    MathSciNet  MATH  Google Scholar 

  210. R.E. Jamison, G.L. Matthews, On the acyclic chromatic number of hamming graphs. Graphs Combin. 24, 349–360 (2008)

    MathSciNet  MATH  Google Scholar 

  211. R.E. Jamison, G.L. Matthews, J. Villalpando, Acyclic colorings of products of trees. Inform. Process. Lett. 99, 7–12 (2006)

    MathSciNet  MATH  Google Scholar 

  212. T.R. Jensen, B. Toft, Graph Coloring Problems (Wiley, New York, 1995)

    MATH  Google Scholar 

  213. T.R. Jensen, B. Toft, Choosability versus chromaticity. Geombinatorics 5, 45–64 (1995)

    MathSciNet  MATH  Google Scholar 

  214. P.K. Jha, A. Narayanan, P. Sood, K. Sundaram, V. Sunder, On L(2, 1)-labelling of the Cartesian product of a cycle and a path. Ars Combin. 55, 81–89 (2000)

    MathSciNet  MATH  Google Scholar 

  215. B. Joshi, K. Kothapalli, On acyclic vertex coloring of grid like graphs, in International Conference on Recent Trends in Graph Theory and Combinatorics, Cochin, 2010, submitted for publication. http://cstar.iiit.ac.in/~kkishore/grid.pdf

  216. M. Kalkowski, A note on the 1,2-conjecture. Electronic J. Combin. (In Press)

    Google Scholar 

  217. M. Kalkowski, M. Karoński, F. Pfender, Vertex-coloring edge-weightings: towards the 1-2-3-conjecture. J. Combin. Theory Ser. B 100, 347–349 (2010)

    MathSciNet  MATH  Google Scholar 

  218. M. Kalkowski, M. Karoński, F. Pfender, A new upper bound for the irregularity strength of graphs. SIAM J. Discrete Math. 25, 1319–1321 (2011)

    MathSciNet  MATH  Google Scholar 

  219. J.-H. Kang, L(2, 1)-labelling of Hamiltonian graphs with maximum degree 3. SIAM J. Discrete Math. 22, 213–230 (2008)

    MathSciNet  MATH  Google Scholar 

  220. R.J. Kang, T. Müller, Frugal, Acyclic and star colourings of graphs. Discrete Appl. Math. 159, 1806–1814 (2011)

    MathSciNet  MATH  Google Scholar 

  221. M. Karoński, T. Łuczak. A. Thomason, Edge weights and vertex colours. J. Combin. Theory Ser. B 91, 151–157 (2004)

    MathSciNet  MATH  Google Scholar 

  222. K. Kawarabayashi, B. Mohar, Star coloring and acyclic coloring of locally planar graphs. SIAM J. Discrete Math. 24, 56–71 (2010)

    MathSciNet  MATH  Google Scholar 

  223. J. Kelly, L. Kelly, Path and circuits in critical graphs. Am. J. Math. 76, 786–792 (1954)

    MATH  Google Scholar 

  224. A.B. Kempe, On the geographical problem of four colours. Am. J. Math. 2, 193–200 (1879)

    MathSciNet  Google Scholar 

  225. S. Khanna, N. Linial, S. Safra, On the hardness of approximating the chromatic number. Combinatorica 20, 393–415 (2000)

    MathSciNet  MATH  Google Scholar 

  226. H.A. Kierstead, A. Kündgen, C. Timmons, Star coloring bipartite planar graphs. J. Graph Theory 60, 1–10 (2009)

    MathSciNet  MATH  Google Scholar 

  227. S.-J. Kim, S. Oum, Injective chromatic number and chromatic number of the square of graphs. Preprint (2009)

    Google Scholar 

  228. D. König, Über graphen und ihre anwendung auf determinantentheorie und mengenlehre. Math. Ann. 77, 453–465 (1916)

    MathSciNet  MATH  Google Scholar 

  229. A.V. Kostochka, Acyclic 6-coloring of planar graphs. Metody Diskret Anal. 28, 40–56 (1976) (in Russian)

    MATH  Google Scholar 

  230. A.V. Kostochka, The total coloring of a multigraph with maximum degree 4. Discrete Math. 17, 161–163 (1977)

    MathSciNet  MATH  Google Scholar 

  231. A.V. Kostochka, Upper bounds of chromatic functions on graphs. Ph.D. Dissertation, Novosibirsk, 1978 (in Russian)

    Google Scholar 

  232. A.V. Kostochka, The total chromatic number of any multigraph with maximum degree five is at most seven. Discrete Math. 162, 199–214 (1996)

    MathSciNet  MATH  Google Scholar 

  233. A.V. Kostochka, L.S. Mel’nikov, Note to the paper of Grünbaum on acyclic colorings. Discrete Math. 14, 403–406 (1976)

    MathSciNet  MATH  Google Scholar 

  234. A.V. Kostochka, D.R. Woodall, Choosability conjectures and multicircuits. Discrete Math. 240, 123–143 (2001)

    MathSciNet  MATH  Google Scholar 

  235. D. Král, Coloring powers of chordal graphs. SIAM J. Discrete Math. 18, 451–461 (2004)

    MathSciNet  MATH  Google Scholar 

  236. D. Král, P. Nejedly, Distance constrained labelings of K 4-minor free graphs. Discrete Math. 309, 5745–5756 (2009)

    MathSciNet  MATH  Google Scholar 

  237. D. Král, R. Škrekovski, A theorem about channel assignment problem. SIAM J. Discrete Math. 16, 426–437 (2003)

    MathSciNet  MATH  Google Scholar 

  238. D. Král, R. Škrekovski, The last excluded case of Dirac’s Map-Color Theorem for choosability. J. Graph Theory 51, 319–354 (2006)

    MathSciNet  MATH  Google Scholar 

  239. W. Kristiana, Slamin, Total vertex irregular labelings of wheels, fans, suns and friendship graphs. J. Combin. Math. Combin. Comput. 65, 103–112 (2008)

    MathSciNet  MATH  Google Scholar 

  240. H.V. Kronk, A.T. White, A 4-color theorem for toroidal graphs. Proc. Am. Math. Soc. 34, 83–85 (1972)

    MathSciNet  Google Scholar 

  241. A. Kündgen, C. Timmons, Star coloring planar graphs from small lists. J. Graph Theory 63, 324–337 (2010)

    MathSciNet  MATH  Google Scholar 

  242. K. Kuratowski, Sur le problème des courbes gauches en topologie. Fund. Math. 15, 271–283 (1930)

    MATH  Google Scholar 

  243. P.C.B. Lam, W.C. Shiu, Z.M. Song, The 3-choosability of plane graphs of girth 4. Discrete Math. 294, 297–301 (2005)

    MathSciNet  MATH  Google Scholar 

  244. P.C.B. Lam, B. Xu, J. Liu, The 4-choosability of plane graphs without 4-cycles. J. Combin. Theory Ser. B 76, 117–126 (1999)

    MathSciNet  MATH  Google Scholar 

  245. J. Lehel, Facts and quests on degree irregular assignments, in Graph Theory, Combinatorics and Applications (Wiley, New York, 1991), pp. 765–782

    Google Scholar 

  246. X. Li, R. Luo, Edge coloring of embedded graphs with large girth. Graphs Combin. 19, 393–401 (2003)

    MathSciNet  MATH  Google Scholar 

  247. C. Li, W. Wang, A. Raspaud, Upper bounds on the linear chromatic number of a graph. Discrete Math. 311, 232–238 (2011)

    MathSciNet  MATH  Google Scholar 

  248. K.-W. Lih, D.D.-F. Liu, W. Wang, On (d, 1)-total numbers of graphs. Discrete Math. 309, 3767–3773 (2009)

    MathSciNet  MATH  Google Scholar 

  249. K.-W. Lih, Z. Song, W. Wang, K. Zhang, A note on list improper coloring planar graphs. Appl. Math. Lett. 14, 269–273 (2001)

    MathSciNet  MATH  Google Scholar 

  250. K.-W. Lih, W. Wang, Coloring the square of an outerplanar graph. Taiwan. J. Math. 10, 1015–1023 (2006)

    MathSciNet  MATH  Google Scholar 

  251. K.-W. Lih, W. Wang, X. Zhu, Coloring the square of a K 4-minor free graph. Discrete Math. 269, 303–309 (2003)

    MathSciNet  MATH  Google Scholar 

  252. X. Liu, M. An, Y. Gao. An upper bound for the adjacent vertex-distinguishing total chromatic number of a graph. J. Math. Res. Expos. 29, 343–348 (2009)

    MathSciNet  MATH  Google Scholar 

  253. D.D.-F. Liu, X. Zhu, Circular distance two labeling and the λ-number for outerplanar graphs. SIAM J. Discrete Math. 19, 281–293 (2005)

    MathSciNet  MATH  Google Scholar 

  254. B. Liu, G. Liu, Vertex-distinguishing edge colorings of graphs with degree sum conditions. Graphs Combin. 26, 781–791 (2010)

    MathSciNet  MATH  Google Scholar 

  255. B. Liu, G. Liu, On the adjacent vertex distinguishing edge colourings of graphs. Int. J. Comput. Math. 87, 726–732 (2010)

    MathSciNet  MATH  Google Scholar 

  256. L. Liu, Z. Zhang, J. Wang, On the adjacent strong edge coloring of outer plane graphs. J. Math. Res. Expos. 25, 255–266 (2005)

    MathSciNet  MATH  Google Scholar 

  257. L. Lovász, A characterization of perfect graphs. J. Combin. Theory Ser. B 13, 95–98 (1972)

    MATH  Google Scholar 

  258. L. Lovász, Three short proofs in graph theory. J. Combin. Theory Ser. B 19, 269–271 (1975)

    MATH  Google Scholar 

  259. H. Lu, Y. Wang, W. Wang, Y. Bu, M. Montassier, A. Raspaud, On the 3-colorability of planar graphs without 4-, 7- and 9-cycles. Discrete Math. 309, 4596–4607 (2009)

    MathSciNet  MATH  Google Scholar 

  260. H. Lu, Q. Yu, C. Zhang, Vertex-coloring 2-edge-weighting of graphs. Eur. J. Combin. 32, 21–27 (2011)

    MathSciNet  MATH  Google Scholar 

  261. X. Luo, The 4-choosability of toroidal graphs without intersecting triangles. Inform. Process. Lett. 102, 85–91 (2007)

    MathSciNet  MATH  Google Scholar 

  262. X. Luo, Chromatic number of square of maximal outerplanar graphs. Appl. Math. J. Chin. Univ. Ser. B 22, 163–168 (2007)

    MATH  Google Scholar 

  263. X. Luo, M. Chen, W. Wang, On 3-colorable planar graphs without cycles of four lengths. Inform. Process. Lett. 103, 150–156 (2007)

    MathSciNet  MATH  Google Scholar 

  264. B. Luzar, R. Škrekovski, M. Tancer, Injective colorings of planar graphs with few colors. Discrete Math. 309, 5636–5649 (2009)

    MathSciNet  MATH  Google Scholar 

  265. B. Luzar, Planar graphs with largest injective chromatic numbers, in: IMFM Preprint Series, 48, 9–11 (2010)

    Google Scholar 

  266. Y. Makarychev, A short proof of Kuratowski’s graph planarity criterion. J. Graph Theory 25, 129–131 (1997)

    MathSciNet  MATH  Google Scholar 

  267. C. McDiarmid, B. Reed, On total colourings of graphs. J. Combin. Theory Ser. B 57, 122–130 (1993)

    MathSciNet  MATH  Google Scholar 

  268. M. Mirzakhani, A small non-4-choosable planar graph. Bull. Inst. Combin. Appl. 17, 15–18 (1996)

    MathSciNet  MATH  Google Scholar 

  269. J. Mitchem, Every planar graph has an acyclic 8-coloring. Duke Math. J. 41, 177–181 (1974)

    MathSciNet  MATH  Google Scholar 

  270. J. Miškuf, R. Škrekovski, M. Tancer, Backbone colorings and generalized Mycielski graph. SIAM J. Discrete Math. 23, 1063–1070 (2009)

    MathSciNet  MATH  Google Scholar 

  271. J. Miškuf, R. Škrekovski, M. Tancer, Backbone coloring of graphs with bounded degree. Discrete Appl. Math. 158, 534–542 (2010)

    MathSciNet  MATH  Google Scholar 

  272. B. Mohar, Acyclic colorings of locally planar graphs. Eur. J. Combin. 26, 491–503 (2005)

    MathSciNet  MATH  Google Scholar 

  273. M. Molloy, B. Reed, Further algorithmic aspects of the local lemma, in Proceedings of the 30th Annual ACM Symposium on Theory of Computing (ACM New York, New York, 1998), pp. 524–529

    Google Scholar 

  274. M. Molloy, B. Reed, A bound on the total chromatic number. Combinatorica 18, 241–280 (1998)

    MathSciNet  MATH  Google Scholar 

  275. M. Molloy, B. Reed, Graph Coloring and the Probabilistic Method (Springer, Berlin, 2002)

    Google Scholar 

  276. M. Molloy, M.R. Salavatipour, A bound on the chromatic number of the square of a planar graph. J. Combin. Theory Ser. B 94, 189–213 (2005)

    MathSciNet  MATH  Google Scholar 

  277. M. Montassier, A note on the not 3-choosability of some families of planar graphs. Inform. Process. Lett. 99, 68–71 (2006)

    MathSciNet  MATH  Google Scholar 

  278. M. Montassier, Acyclic 4-choosability of planar graphs with girth at least 5, in Trends in Mathematics: Graph Theory in Paris (Birkhüuser, Basel, 2007), pp. 299–310

    Google Scholar 

  279. M. Montassier, P. Ochem, A. Raspaud, On the acyclic choosability of graphs. J. Graph Theory 51, 281–300 (2006)

    MathSciNet  MATH  Google Scholar 

  280. M. Montassier, A. Raspaud, (d, 1)-Total labelling of graphs with a given maximum average degree. J. Graph Theory 51, 93–109 (2006)

    MathSciNet  MATH  Google Scholar 

  281. M. Montassier, A. Raspaud, A note on 2-facial coloring of plane graphs. Inform. Process. Lett. 98, 235–241 (2006)

    MathSciNet  MATH  Google Scholar 

  282. M. Montassier, A. Raspaud, W. Wang, Acyclic 4-choosability of planar graphs without cycles of specific lengths, in Topics in Discrete Mathematics: Algorithms and Combinatorics, vol. 26 (Springer, Berlin, 2006), pp. 473–491

    Google Scholar 

  283. M. Montassier, A. Raspaud, W. Wang, Bordeaux 3-color conjecture and 3-choosability. Discrete Math. 306, 573–579 (2006)

    MathSciNet  MATH  Google Scholar 

  284. M. Montassier, A. Raspaud, W. Wang, Acyclic 5-choosability of planar graphs without small cycles. J. Graph Theory 54, 245–260 (2007)

    MathSciNet  MATH  Google Scholar 

  285. R. Muthu, N. Narayanan, C.R. Subramanian, Improved bounds on acyclic edge coloring. Electron. Note Discrete Math. 19, 171–177 (2005)

    MathSciNet  Google Scholar 

  286. R. Muthu, N. Narayanan, C.R. Subramanian, Improved bounds on acyclic edge coloring. Discrete Math. 307, 3063–3069 (2007)

    MathSciNet  MATH  Google Scholar 

  287. R. Muthu, N. Narayanan, C.R. Subramanian, Acyclic edge coloring of outerplanar graphs, in Algorithmic Aspects in Information and Management, 3rd AAIM, Portland. Lecture Notes in Computer Science, vol. 4508, 2007, pp. 144–152

    Google Scholar 

  288. R. Muthu, N. Narayanan, C.R. Subramanian, Acyclic edge colouring of partial 2-trees. http://www.imsc.res.in/~narayan/p2t.pdf

  289. J. Mycielski, On the coloring of graphs. Colloq. Math. 3, 161–162 (1955)

    MathSciNet  MATH  Google Scholar 

  290. T. Nierhoff, A tight bound on the irregularity strength of graphs. SIAM J. Discrete Math. 13, 313–323 (2000)

    MathSciNet  Google Scholar 

  291. J. Nes̆etr̆il, P. Ossana de Mendez, Colorings and homomorphisms of minor closed classes, in Discrete and Computational Geometry: The Goodman-Pollack Festschrift, Algorithms and Combinatorics (Spring, Berlin, 2003), pp. 651–664

    Google Scholar 

  292. J. N\check{e}set\check{r}il, N.C. Wormald, The acyclic edge chromatic number of a random d-regular graph is d + 1. J. Graph Theory 49, 69–74 (2005)

    Google Scholar 

  293. C.T. Palmer, Edge weightings and the chromatic number. Ph.D. Dissertation, Central European University, 2008

    Google Scholar 

  294. J. Przybyło, A note on a neighbour-distinguishing regular graphs total-weighting. Electron. J. Combin. 15, #R35 (2008)

    Google Scholar 

  295. J. Przybyło, Irregularity strength of regular graphs. Electron. J. Combin. 15, #R82 (2008)

    Google Scholar 

  296. J. Przybyło, Linear bound on the irregularity strength and the total vertex irregularity strength of graphs. SIAM J. Discrete Math. 23, 511–516 (2009)

    Google Scholar 

  297. J. Przybyło, M. Woźniak, On a 1,2 conjecture. Discrete Math. Theor. Comput. Sci. 12, 101–108 (2010)

    MathSciNet  MATH  Google Scholar 

  298. J. Przybyło, M. Woźniak, Total weight choosability of graphs. J. Graph Theory 66, 198–212 (2011)

    MathSciNet  Google Scholar 

  299. A. Raspaud, W. Wang, Linear coloring of planar graphs with large girth. Discrete Math. 309, 5678–5686 (2009)

    MathSciNet  MATH  Google Scholar 

  300. B. Reed, ω, Δ, and χ. J. Graph Theory 27, 177–212 (1998)

    MathSciNet  MATH  Google Scholar 

  301. B. Reed, A strengthening of Brooks’ theorem. J. Combin. Theory Ser. B 76, 136–149 (1999)

    MathSciNet  MATH  Google Scholar 

  302. G. Ringel, Map Color Theorem (Springer, New York, 1974)

    MATH  Google Scholar 

  303. G. Ringel, J.W.T. Youngs, Solution of the Heawood map-color problem. Proc. Natl. Acad. Sci. USA 60, 438–445 (1968)

    MathSciNet  MATH  Google Scholar 

  304. F.S. Roberts, T-colorings of graphs: recent results and open problems. Discrete Math. 93, 229–245 (1991)

    MathSciNet  MATH  Google Scholar 

  305. N. Robertson, P. Seymour, R. Thomas, Hadwiger’s conjecture for K 5-free graphs. Combinatorica 14, 279–361 (1993)

    MathSciNet  Google Scholar 

  306. M. Rosenfeld, On the total coloring of certain graphs. Israel J. Math. 9, 396–402 (1971)

    MathSciNet  MATH  Google Scholar 

  307. J. Rudašová, R. Soták, Vertex-distinguishing proper edge colourings of some regular graphs. Discrete Math. 308, 795–802 (2008)

    MathSciNet  MATH  Google Scholar 

  308. D. Sakai, Labelling chordal graphs with a condition at distance two. SIAM J. Discrete Math. 7, 133–140 (1994)

    MathSciNet  MATH  Google Scholar 

  309. A.N.M. Salman, λ-Backbone colorings numbers of split graphs with tree backbones, in Proceedings of the 2nd IMT-GT Regional Conference on Mathematics, Statistics and Applications, Universiti Sains Malaysia, Penang, 13–15 June 2006

    Google Scholar 

  310. D.P. Sanders, Y. Zhao, A note on the three coloring problem. Graphs Combin. 11, 92–94 (1995)

    MathSciNet  Google Scholar 

  311. D.P. Sanders, Y. Zhao, On total 9-coloring planar graphs of maximum degree seven. J. Graph Theory 31, 67–73 (1999)

    MathSciNet  MATH  Google Scholar 

  312. D.P. Sanders, Y. Zhao, Planar graphs of maximum degree seven are class I. J. Combin. Theory Ser. B 83, 201–212 (2001)

    MathSciNet  MATH  Google Scholar 

  313. C. Schwarz, D.S. Troxell, L(2, 1)-labelling of products of two cycles. Discrete Appl. Math. 154, 1522–1540 (2006)

    MathSciNet  MATH  Google Scholar 

  314. L. Shen, Y. Wang, A sufficient condition for a planar graph to be 3-choosable. Inform. Process. Lett. 104, 146–151 (2007)

    MathSciNet  MATH  Google Scholar 

  315. L. Shen, Y. Wang, On the 7 total colorability of planar graphs with maximum degree 6 and without 4-cycles. Graphs Combin. 25, 401–407 (2009)

    MathSciNet  MATH  Google Scholar 

  316. L. Shen, Y. Wang, Total colorings of planar graphs with maximum degree at least 8. Sci. China Ser. A 52, 1733–1742 (2009)

    MathSciNet  MATH  Google Scholar 

  317. Q. Shu, W. Wang, Acyclic chromatic indices of planar graphs with girth at least five. J. Comb. Optim. 23, 140–157 (2012)

    MathSciNet  MATH  Google Scholar 

  318. Q. Shu, W. Wang, Y. Wang, Acyclic chromatic indices of planar graphs with girth at least four. J. Graph Theory. (2012) doi: 10.1002/jgt.21683

    Google Scholar 

  319. R. Škrekovski, A Grötzsch-type theorem for list colorings with impropriety one. Combin. Probab. Comput. 8, 493–507 (1999)

    MathSciNet  MATH  Google Scholar 

  320. R. Škrekovski, List improper colorings of planar graphs. Combin. Prob. Comput. 8, 293–299 (1999)

    MATH  Google Scholar 

  321. S. Skulrattanakulchai, Acyclic colorings of subcubic graphs. Inform. Process. Lett. 92, 161–167 (2004)

    MathSciNet  MATH  Google Scholar 

  322. R. Steinberg, The state of the three color problem, in Quo Vadis, Graph Theory? ed. by J. Gimbel, J.W. Kennedy, L.V. Quintas. Annals of Discrete Mathematics, vol 55 (1993) pp. 211–248

    Google Scholar 

  323. X. Sun, J. Wu, Acyclic edge colorings of planar graphs without short cycles, in The 7-th ISORA’08, Lijiang, 2008, pp. 325–329

    Google Scholar 

  324. G. Szekeres, H.S. Wilf, An inequality for the chromatic number of a graph. J. Combin. Theory 4, 1–3 (1968)

    MathSciNet  Google Scholar 

  325. K. Taczuk, M. Woźniak, A note on the vertex-distinguishing index for some cubic graphs. Opuscula Math. 24, 223–229 (2004)

    MathSciNet  MATH  Google Scholar 

  326. C. Thomassen, Planarity and duality of finite and infinite graphs. J. Combin. Theory Ser. B 29, 244–271 (1980)

    MathSciNet  MATH  Google Scholar 

  327. C. Thomassen, Kuratowski’s theorem. J. Graph Theory 5, 225–241 (1981)

    MathSciNet  MATH  Google Scholar 

  328. C. Thomassen, Every planar graph is 5-choosable. J. Combin. Theory Ser. B 62, 180–181 (1994)

    MathSciNet  MATH  Google Scholar 

  329. C. Thomassen, Grötzsch 3-color theorem and its counterparts for the torus and the projective plane. J. Combin. Theory Ser. B 62, 268–279 (1994)

    MathSciNet  MATH  Google Scholar 

  330. C. Thomassen, Five-coloring graphs on the torus. J. Combin Theory Ser. B 62, 11–33 (1994)

    MathSciNet  MATH  Google Scholar 

  331. C. Thomassen, 3-List-coloring planar graphs of girth 5. J. Combin. Theory Ser. B 64, 101–107 (1995)

    MathSciNet  MATH  Google Scholar 

  332. C. Thomassen, Applications of Tutte cycles. Technical report, Technical University of Denmark, 2001

    Google Scholar 

  333. C. Thomassen, Some remarks on Hajós’ conjecture. J. Combin. Theory Ser. B 93, 95–105 (2005)

    MathSciNet  MATH  Google Scholar 

  334. C. Timmons, Star-coloring planar graphs. Master’s Thesis, California State University San Marcos, May 2007

    Google Scholar 

  335. C. Timmons, Star coloring high girth planar graphs. Electron. J. Combin. 15, #R124 (2008)

    MathSciNet  Google Scholar 

  336. O. Togni, Irregularity strength of the toroidal grid. Discrete Math. 165/166, 609–620 (1997)

    MathSciNet  Google Scholar 

  337. S. Varagani, V. Ch. Venkaiah, K. Yadav, K. Kothapalli, Acyclic vertex WQ3Qcoloring of graphs of maximum degree six. Electron. Note Discrete Math. 35, 177–182 (2009)

    MathSciNet  Google Scholar 

  338. N. Vijayaditya, On total chromatic number of a graph. J. Lond. Math. Soc. 3(2), 405–408 (1971)

    MathSciNet  MATH  Google Scholar 

  339. V.G. Vizing, On the estimate of the chromatic class of a p-graphs. Metody Diskret. Analiz. 3, 25–30 (1964) (in Russian)

    MathSciNet  Google Scholar 

  340. V.G. Vizing, Some unsolved problems in graph theory. Uspekhi Mat. Nauk 23, 117–134 (1968) (in Russian)

    MathSciNet  MATH  Google Scholar 

  341. V.G. Vizing, Vertex coloring with given colors. Metody Diskret. Analiz. 29, 3–10 (1976) (in Russian)

    MathSciNet  MATH  Google Scholar 

  342. M. Voigt, List colourings of planar graphs. Discrete Math. 120, 215–219 (1993)

    MathSciNet  MATH  Google Scholar 

  343. M. Voigt, A not 3-choosable planar graph without 3-cycles. Discrete Math. 146, 325–328 (1995)

    MathSciNet  MATH  Google Scholar 

  344. M. Voigt, A non-3-choosable planar graph without cycles of length 4 and 5. Discrete Math. 307, 1013–1015 (2007)

    MathSciNet  MATH  Google Scholar 

  345. K. Wagner, Über eine Eigenschaft der ebene Komplexe. Math. Ann. 114, 570–590 (1937)

    MathSciNet  Google Scholar 

  346. P.J. Wan, Near-optimal conflict-free channel set assignments for an optical cluster-based hypercube network. J. Comb. Optim. 1, 179–186 (1997)

    MathSciNet  MATH  Google Scholar 

  347. H. Wang, On the adjacent vertex distinguishing total chromatic number of the graphs with Δ(G) = 3. J. Comb. Optim. 14, 87–109 (2007)

    MathSciNet  MATH  Google Scholar 

  348. W. Wang, The L(2, 1)-labelling of trees. Discrete Appl. Math. 154, 598–603 (2006)

    MathSciNet  MATH  Google Scholar 

  349. W. Wang, Total chromatic number of planar graphs with maximum degree ten. J. Graph Theory 54, 91–102 (2007)

    MathSciNet  MATH  Google Scholar 

  350. W. Wang, Y. Bu. M. Montassier, A. Raspaud, On backbone coloring of graphs. J. Comb. Optim. 23, 79–93 (2012)

    MathSciNet  MATH  Google Scholar 

  351. W. Wang, L. Cai, Labelling planar graphs without 4-cycles with a condition on distance two. Discrete Appl. Math. 156, 2241–2249 (2008)

    MathSciNet  MATH  Google Scholar 

  352. W. Wang, D. Chen, (2, 1)-Total number of trees with maximum degree three. Inform. Process. Lett. 109, 805–810 (2009)

    MathSciNet  MATH  Google Scholar 

  353. W. Wang, M. Chen, Planar graphs without 4, 6 and 8-cycles are 3-colorable. Sci. China Ser. A 50, 1552–1562 (2007)

    MathSciNet  MATH  Google Scholar 

  354. W. Wang, M. Chen, On 3-colorable planar graphs without prescribed cycles. Discrete Math. 307, 2820–2825 (2007)

    MathSciNet  MATH  Google Scholar 

  355. W. Wang, M. Chen, Planar graphs without 4-cycles are acyclically 6-choosable. J. Graph Theory 61, 307–323 (2009)

    MathSciNet  MATH  Google Scholar 

  356. W. Wang, J. Huang, H. Sun, D. Huang, (2,1)-Total number of joins of paths and cycles. Taiwan. J. Math. 16, 605–619 (2012)

    MathSciNet  MATH  Google Scholar 

  357. W. Wang, C. Li, Linear coloring of graphs embeddable in a surface of nonnegative characteristic. Sci. China Ser. A 52, 991–1003 (2009)

    MathSciNet  MATH  Google Scholar 

  358. W. Wang, K.-W. Lih, The 4-choosability of planar graphs without 6-cycles. Australas J. Combin. 24, 157–164 (2001)

    MathSciNet  MATH  Google Scholar 

  359. W. Wang, K.-W. Lih, Choosability and edge choosability of planar graphs without five cycles. Appl. Math. Lett. 15, 561–565 (2002)

    MathSciNet  MATH  Google Scholar 

  360. W. Wang, K.-W. Lih, Choosability and edge choosability of planar graphs without intersection triangles. SIAM J. Discrete Math. 15, 538–545 (2003)

    MathSciNet  Google Scholar 

  361. W. Wang, K.-W. Lih, Note on coloring the square of an outerplanar graph. Ars Combin. 86, 89–95 (2008)

    MathSciNet  MATH  Google Scholar 

  362. Y. Wang, H. Lu, M. Chen, Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable. Discrete Math. 310, 147–158 (2010)

    MathSciNet  MATH  Google Scholar 

  363. W. Wang, X. Luo, Some results on distance two labelling of outerplanar graphs. Acta Math. Appl. Sin. English Ser. 25, 21–32 (2009)

    MathSciNet  Google Scholar 

  364. Y. Wang, X. Mao, H. Lu, W. Wang, On 3-colorability of planar graphs without adjacent short cycles. Sci. China Ser. A 53, 1129–1132 (2010)

    MathSciNet  MATH  Google Scholar 

  365. W. Wang, Q. Shu, K. Wang, P. Wang, Acyclic chromatic indices of planar graphs with large girth. Discrete Appl. Math. 159, 1239–1253 (2011)

    MathSciNet  MATH  Google Scholar 

  366. W. Wang, Q. Shu. Acyclic chromatic indices of K 4-minor free graphs (in Chinese). Sci. Sin. Math. 41, 733–344 (2011)

    Google Scholar 

  367. W. Wang, P. Wang, Acyclic chromatic indices of planar graphs with large girth Preprint (2008)

    Google Scholar 

  368. W. Wang, P. Wang, Adjacent vertex distinguishing total colorings of K 4-minor free graphs. Sci. China Ser. A 39, 1462–1467 (2009) (in Chinese)

    Google Scholar 

  369. W. Wang, Y. Wang, L(p, q)-labelling of K 4-minor free graphs. Inform. Process. Lett. 98, 169–173 (2006)

    MathSciNet  MATH  Google Scholar 

  370. W. Wang, Y. Wang, Adjacent vertex distinguishing total colorings of graphs with lower average degree. Taiwan. J. Math. 12, 979–990 (2008)

    MATH  Google Scholar 

  371. W. Wang, Y. Wang, Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree. J. Comb. Optim. 19, 471–485 (2010)

    MathSciNet  MATH  Google Scholar 

  372. W. Wang, Y. Wang, Adjacent vertex distinguishing edge colorings of K 4-minor free graphs. Appl. Math. Lett. 24, 2034–2037 (2011)

    MathSciNet  MATH  Google Scholar 

  373. Y. Wang, W. Wang, Adjacent vertex distinguishing total colorings of outerplanar graphs. J. Comb. Optim. 19, 123–133 (2010)

    MathSciNet  MATH  Google Scholar 

  374. P. Wang, J. Wu, A note on total colorings of planar graphs without 4-cycles. Discuss. Math. Graph Theory 24, 125–135 (2004)

    MathSciNet  MATH  Google Scholar 

  375. Y. Wang, Q. Wu, L. Shen, Planar graphs without cycles of length 4, 7, 8, or 9 are 3-choosable. Discrete Appl. Math. 159, 232–239 (2011)

    MathSciNet  MATH  Google Scholar 

  376. T. Wang, Q. Yu, On vertex-coloring 13-edge-weighting. Front. Math. China 3, 1–7 (2008)

    MathSciNet  Google Scholar 

  377. G. Wegner, Note on a paper by B. Grunbaum on acyclic colorings. Israel J. Math. 14, 409–412 (1973)

    MathSciNet  MATH  Google Scholar 

  378. G. Wegner, Graphs with given diameter and a coloring problem. Technical report, University of Dortmund, Dortmund, 1977

    Google Scholar 

  379. D. B. West, Introduction to Graph Theory (Pearson Education, USA, 2002)

    Google Scholar 

  380. C. Whitehead, N. Zagaglia Salvi, Observability of the extended Fibonacci cubes. Discrete Math. 266, 431–440 (2003)

    MathSciNet  MATH  Google Scholar 

  381. M.A. Whittlesey, J.P. Georges, D.W. Mauro, On the λ-number of Q n and related graphs. SIAM J. Discrete Math. 8, 99–506 (1995)

    MathSciNet  Google Scholar 

  382. T.-L. Wong, X. Zhu, D. Yang, List total weighting of graphs. Bolyai Soc. Math. Stud. 20, 337–353 (2010)

    MathSciNet  Google Scholar 

  383. T.-L. Wong, X. Zhu, Total weight choosability of graphs. J. Graph Theory 66, 198–212 (2011)

    MathSciNet  MATH  Google Scholar 

  384. B. Xu, H. Zhang, Every toroidal graph without adjacent triangles is (4, 1)∗-choosable. Discrete Appl. Math. 155, 74–78 (2007)

    MathSciNet  MATH  Google Scholar 

  385. K. Yadava, S. Varagani, K. Kothapalli, V. Ch. Venkaiah, Acyclic vertex coloring of graphs of maximum degree 4. http://www.jaist.ac.jp

  386. K. Yadava, S. Varagani, K. Kothapalli, V. Ch. Venkaiah, Acyclic vertex coloring of graphs of maximum degree 5. Discrete Math. 311, 342–348 (2011)

    MathSciNet  Google Scholar 

  387. H.P. Yap, Total colourings of graphs, in Lecture Notes in Mathematics, vol. 1623 (Springer, London, 1996)

    MATH  Google Scholar 

  388. R.G. Yeh, A survey on labelling graphs with a condition at distance two. Discrete Math. 306, 1217–1231 (2006)

    MathSciNet  MATH  Google Scholar 

  389. H.G. Yeh, X. Zhu, 4-Colorable 6-regular toroidal graphs. Discrete Math. 273, 261–274 (2003)

    MathSciNet  MATH  Google Scholar 

  390. D. Yu, J. Hou, G. Liu, B. Liu, L. Xu, Acyclic edge coloring of planar graphs with large girth. Theor. Comput. Sci. 410, 5196–5200 (2009)

    MathSciNet  MATH  Google Scholar 

  391. R. Yuster, Linear coloring of graphs. Discrete Math. 185, 293–297 (1998)

    MathSciNet  MATH  Google Scholar 

  392. N. Zagaglia Salvi, On the point-distinguishing chromatic index of K n, n . Ars Combin. 25, 93–104 (1988)

    MathSciNet  Google Scholar 

  393. N. Zagaglia Salvi, On the value of the point-distinguishing chromatic index of K n, n . Ars Combin. 29, 235–244 (1990)

    MathSciNet  Google Scholar 

  394. L. Zhang, Every planar graph with maximum degree 7 is of class 1. Graphs Combin. 16, 467–495 (2000)

    MathSciNet  MATH  Google Scholar 

  395. Z. Zhang, X. Chen, J. Li, B. Yao, X. Lu, J. Wang, On adjacent-vertex-distinguishing total coloring of graphs. Sci. China Ser. A 48, 289–299 (2005)

    MathSciNet  MATH  Google Scholar 

  396. Z. Zhang, L. Liu, J. Wang, Adjacent strong edge coloring of graphs. Appl. Math, Lett. 15, 623–626 (2002)

    MathSciNet  MATH  Google Scholar 

  397. Z. Zhang, D.R. Woodall, B. Yao, J. Li, X. Chen, L. Bian, Adjacent strong edge colorings and total colorings of regular graphs. Sci. China Ser. A 52, 973–980 (2009)

    MathSciNet  MATH  Google Scholar 

  398. L. Zhang, B. Wu, Three-coloring planar graphs without certain small cycles. Graph Theory Notes NY 46, 27–30 (2004)

    MATH  Google Scholar 

  399. L. Zhang, B. Wu, A note on 3-choosability of planar graphs without certain cycles. Discrete Math. 297, 206–209 (2005)

    MathSciNet  MATH  Google Scholar 

  400. H. Zhang, B. Xu, Acyclic 5-choosability of planar graphs with neither 4-cycles nor chordal 6-cycles. Discrete Math. 309, 6087–6091 (2009)

    MathSciNet  MATH  Google Scholar 

  401. H. Zhang, B. Xu, Z. Sun, Every plane graph with girth at least 4 without 8- and 9-circuits is 3-choosable. Ars Combin. 80, 247–257 (2006)

    MathSciNet  MATH  Google Scholar 

  402. A. Zykov, On some properties of linear complexes. Mat. Sbornik 24, 163–188 (1949) (in Russian)

    MathSciNet  Google Scholar 

Download references

Acknowledgements

The authors deeply thank their postgraduate students M. Chen, D. Huang, Q. Shu, S. Zhang, W. Gao, and Y. Wang for their careful search for a number of literatures and patience inspection for this manuscript.

Author information

Authors and Affiliations

  1. Department of Mathematics, Zhejiang Normal University, Jinhua, Jinhua, People’s Republic of China

    Weifan Wang

  2. Department of Mathematics, Zhejiang Normal University, Jinhua, Jinhua, People’s Republic of China

    Yuehua Bu

Authors
  1. Weifan Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yuehua Bu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Industrial and Systems Eng, University of Florida, Gainesville, Florida, USA

    Panos M. Pardalos

  2. Department of Computer Science, University of Texas, Dallas, Richardson, Texas, USA

    Ding-Zhu Du

  3. Dept. Comp. Sci. & Engineering, University of California, San Diego, La Jolla, California, USA

    Ronald L. Graham

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer Science+Business Media New York

About this entry

Cite this entry

Wang, W., Bu, Y. (2013). On Coloring Problems. In: Pardalos, P., Du, DZ., Graham, R. (eds) Handbook of Combinatorial Optimization. Springer, New York, NY. https://doi.org/10.1007/978-1-4419-7997-1_59

Download citation

Publish with us

Policies and ethics

Search

Navigation