Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
Hostname: page-component-76fb5796d-r6qrq Total loading time: 0 Render date: 2024-04-26T09:51:27.393Z Has data issue: false hasContentIssue false

6 - List-colourings

Published online by Cambridge University Press:  05 May 2015

By
Michael Stiebitz  and
Margit Voigt
Edited by
Lowell W. Beineke  and
Robin J. Wilson
Michael Stiebitz
Affiliation:
Technical University Ilmenau
Margit Voigt
Affiliation:
Technical University Ilmenau
Lowell W. Beineke
Affiliation:
Purdue University, Indiana
Robin J. Wilson
Affiliation:
The Open University, Milton Keynes
Get access

Summary

A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Chapter
Information
Topics in Chromatic Graph Theory , pp. 114 - 136
Publisher: Cambridge University Press
Print publication year: 2015

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1. M. O., Albertson, You can't paint yourself into a corner, J. Combin. Theory (B) 73 (1998), 189–194.Google Scholar
2. M. O., Albertson, A. V., Kostochka and D. B., West, Precoloring extension of Brooks' theorem, SIAM J. Discrete Math. 18 (2004), 542–553.Google Scholar
3. N., Alon, Choice numbers of graphs; a probabilistic approach, Combin. Probab. Comput. 1 (1992), 107–114.Google Scholar
4. N., Alon, Restricted colorings of graphs, Surveys in Combinatorics, 1993 (ed. K., Walker), Cambridge University Press (1993), 1–33.Google Scholar
5. N., Alon, The combinatorial Nullstellensatz, Combin. Probab. Comput. 8 (1999), 7–29.Google Scholar
6. N., Alon and M., Tarsi, Colorings and orientations of graphs, Combinatorica 12 (1992), 125–134.Google Scholar
7. N., Alon, Zs., Tuza and M., Voigt, Choosability and fractional chromatic number, Discrete Math. 165/166 (1997), 31–38.Google Scholar
8. M., Axenovich, A note on graph coloring extensions and list colorings, Electronic J. Combin. 10 (2003), N1.Google Scholar
9. O. V., Borodin, Colorings of planar graphs: a survey, Discrete Math. 313 (2013), 517–539.Google Scholar
10. O. V., Borodin, A. V., Kostochka and D. R., Woodall, List edge and list total colourings of multigraphs, J. Combin. Theory (B) 71 (1997), 184–204.Google Scholar
11. L., Cai, W., Wang and X., Zhu, Choosability of toroidal graphs without short cycles, J. Graph Theory 65 (2010), 1–15.Google Scholar
12. D. W., Cranston, A., Pruchnewski, Zs., Tuza and M., Voigt, List colorings of K5-minor-free graphs with special list assignments, J. Graph Theory 71 (2012), 18–30.Google Scholar
13. M., DeVos, K., Kawarabayashi and B., Mohar, Locally planar graphs are 5-choosable, J. Combin. Theory (B) 98 (2008), 1215–1232.Google Scholar
14. Z., Dvořák, B., Lidickl, B., Mohar and L., Postle, 5-list-coloring planar graphs with distant precolored vertices, arXiv:1209.0366 [math.CO].
15. Z., Dvořák, B., LidickiandR., Skrekovski, Planar graphs without 3-, 7-, and 8-cycles are 3-choosable, Discrete Math. 309 (2009), 5899–5904.Google Scholar
16. Z., Dvořák, B., LidickiandR., Skrekovski, 3-choosability of triangle-free planar graphs with constraints on 4-cycles, SIAMJ. Discrete Math. 24 (2010), 934–945.Google Scholar
17. M. N., Ellingham and L., Goddyn, List edge colourings of some 1-factorizable multigraphs, Combinatorica 16 (1996), 343–352.Google Scholar
18. P., Erdős, A. L., Rubin and H., Taylor, Choosability in graphs, Congr. Numer. XXVI (1979), 125–157.Google Scholar
19. B., Farzad, On Four Colourings of Graphs, Ph.D. thesis, University of Toronto, 2005.Google Scholar
20. B., Farzad, Planar graphs without 7-cycles are 4-choosable, SIAM J. Discrete Math. 23 (2009), 1179–1199.Google Scholar
21. G., Fijavž, M., Juvan, B., Mohar and R., Škrekovski, Planar graphs without cycles of specific length, European J. Combin. 23 (2002), 377–388.Google Scholar
22. H., Fleischner and M., Stiebitz, A solution to a colouring problem of P. Erdős, Discrete Math. 101 (1992), 39–48.Google Scholar
23. F., Galvin, The list chromatic index of a bipartite multigraph, J. Combin. Theory (B) 63 (1995), 153–158.Google Scholar
24. S., Gravier and F., Maffrey, Choice number of 3-colorable elementary graphs, Discrete Math. 165/166 (1997), 353–358.Google Scholar
25. H., Grötzsch, Ein Dreifarbensatz fur dreikreisfreie Netze auf der Kugel, Wiss. Zeitschrift der Universitat Halle, Math.-Nat. VIII/1 (1958), 109–119.Google Scholar
26. J.-L., Guo and Y.-L., Wang, 3-list-coloring planar graphs of girth 4, Discrete Math. 311 (2011), 413–417.Google Scholar
27. S., Gutner, Choice Numbers of Graphs, M.Sc. thesis, Tel Aviv University, 1992.Google Scholar
28. S., Gutner, The complexity of planar graph choosability, Discrete Math. 159 (1996), 119–130.Google Scholar
29. A. J. W., Hilton and P. D., Johnson, The Hall number, the Hall index, and the total Hall number of a graph, Discrete Appl. Math. 94 (1999), 227–245.Google Scholar
30. J. P., Hutchinson, On list-coloring outerplanar graphs, J. Graph Theory 59 (2008), 59–74.Google Scholar
31. T. R., Jensen and B., Toft, Graph Coloring Problems, Wiley Interscience, 1995.Google Scholar
32. M., Juvan, B., Mohar and R., Šrkrekovski, List-total colorings of graphs, Combin. Probab. Comput. 7 (1998), 181–188.Google Scholar
33. M., Juvan, B., Mohar and R., Škrekovski, Graphs of degree 4 are 5-edge-choosable, J. Graph Theory 32 (1999), 250–262.Google Scholar
34. M., Juvan, B., Mohar and R., Thomas, List edge-coloring of series-parallel graphs, Electronic J. Combin. 6(1) (1999), R42.Google Scholar
35. J., Kahn, Asymtoticaily good list colourings, J. Combin. Theory (A) 73 (1996), 1–59.Google Scholar
36. K., Kawarabayashi and C., Thomassen, From the plane to higher surfaces, J. Combin. Theory (B) 102 (2012), 852–868.Google Scholar
37. A. V., Kostochka, Color-critical graphs and hypergraphs with few edges: a survey, Bolyai Society Mathematical Studies 15 (2006), 175–197.Google Scholar
38. A. V., Kostochka and D. R., Woodall, Choosability conjecture and multicircuits, Discrete Math. 240 (2001), 123–143.Google Scholar
39. A. V., Kostochka and D. R., Woodall, Total choosability of multicircuits I, II, J. Graph Theory 40 (2002), 26–43, 44–67.Google Scholar
40. J., Kratochvíl, Zs., Tuza and M., Voigt, New trends in the theory of graph colorings: Choosability and list colorings, DIMACS, Series in Discrete Mathematics and Theoretical Computer Science 49 (1999), 183–198.Google Scholar
41. P. C. B., Lam, J., Liu and B., Xu, The 4-choosability of plane graphs without 4-cycles, J. Combin. Theory (B) 76 (1999), 117–126.Google Scholar
42. P. C. B., Lam, W. C., Shiu and B., Xu, On structure of some plane graphs with application to choosability, J. Combin. Theory (B) 82 (2001), 285–296.Google Scholar
43. K., Lih and W., Wang, Choosability, edge-choosability and total choosability of outerplane graphs, Europ. J. Combin. 22 (2001), 71–78.Google Scholar
44. K., Lih and W., Wang, Choosability and edge choosability of planar graphs without intersecting triangles, SIAM J. Discrete Math. 15 (2002), 538–545.Google Scholar
45. K., Lih and W., Wang, Choosability and edge choosability of planar graphs without five cycles, Appl. Math. Lett. 15 (2002), 561–565.Google Scholar
46. R., Li and B., Xu, Edge choosability and total choosability of planar graphs with no 3-cycles adjacent to 4-cycles, Discrete Math. 311 (2011), 2158–2163.Google Scholar
47. B., Liu, J., Hou and G., Liu, List edge and list total colorings of planar graphs without short cycles, Inform. Process. Lett. 108 (2008), 347–351.Google Scholar
48. M., Mirzakhani, A small non-4-choosable planar graph, Bull. Inst. Combin. Appl. 17 (1996), 15–18.Google Scholar
49. M., Montassier, A., Raspaud and W., Wang, Bordeaux 3-color conjecture and 3-choosability, Discrete Math. 306 (2006), 573–579.Google Scholar
50. J. A., Noel, B. A., Reed and H., Wu, A proof of a conjecture of Ohba, manuscript, (2012).
51. A., Prowse and D. R., Woodall, Choosability and powers of circuits, Graphs Combin. 19 (2003), 137–147.Google Scholar
52. A., Pruchnewski and M., Voigt, Precoloring extension for K4-minor-free graphs, J. Graph Theory 60 (2009), 284–294.Google Scholar
53. T., Rackham, A note on free precolouring with Δ colours, Electronic J. Combin. 16 (2009), N28.Google Scholar
54. H., Sheng and Y., Wang, A structural theorem for planar graphs with some applications, Discrete Appl. Math. 159 (2011), 1183–1187.Google Scholar
55. R., Škrekovski, Choosability of K5-minor-free graphs, Discrete Math. 190 (1998), 223–226.Google Scholar
56. M., Stiebitz, Zs., Tuza and M., Voigt, Orientations of graphs with prescribed weighted out-degrees, Graphs Combin. (2013).Google Scholar
57. C., Thomassen, Every planar graph is 5-choosable, J. Combin. Theory (B) 62 (1994), 180–181.Google Scholar
58. C., Thomassen, 3-list-coloring planar graphs of girth 5, J. Combin. Theory (B) 64 (1995), 101–107.Google Scholar
59. C., Thomassen, Many 3-colorings of triangle-free planar graphs, J. Combin. Theory (B) 97 (2007), 334–349.Google Scholar
60. C., Thomassen, Exponentially many 5-colorings of planar graphs, J. Combin. Theory (B) 97 (2007), 571–583.Google Scholar
61. Zs., Tuza, Graph colorings with local constraints – A survey, Discuss. Math.– Graph Theory 17 (1997), 161–228.Google Scholar
62. Zs., Tuza, Choice-perfect graphs, Discuss. Math.– Graph Theory 33 (2013), 231–242.Google Scholar
63. Zs., Tuza and M., Voigt, On a conjecture of Erdos, Rubin and Taylor, Discuss. Math-Graph Theory 9 (1996), 69–82.Google Scholar
64. Zs., Tuza and M., Voigt, List colorings and reducibility, Discrete Appl. Math. 79 (1997), 247–256.Google Scholar
65. V. G., Vizing, Coloring the vertices of a graph in prescribed colors, (in Russian), Metody Diskret. Anal. v Teorii Kodov i Schem 29 (1976), 3–10.Google Scholar
66. M., Voigt, List colorings of planar graphs, Discrete Math. 120 (1993), 215–219.Google Scholar
67. M., Voigt, A not 3-choosable planar graph without 3-cycles, Discrete Math. 146 (1995), 325–328.Google Scholar
68. M., Voigt, Choosability of planar graphs, Discrete Math. 150 (1996), 457–460.Google Scholar
69. M., Voigt, A non-3-choosable planar graph without cycles of length 4 and 5, Discrete Math. 294 (2005), 297–301.Google Scholar
70. W., Wang, Edge choosability of planar graphs without short cycles, Science in China (A)–Mathematics 48 (2005), 1531–1544.Google Scholar
71. Y., Wang, Q., Wu and L., Shen, Planar graphs without cycles of length 4, 7, 8 or 9 are 3-choosable, Discrete Appl. Math. 159 (2011), 232–239.Google Scholar
72. D. R., Woodall, List colourings of graphs, Surveys in Combinatorics, 2001 (ed. J.W.P., Hirschfeld), London Math. Soc. Lecture Notes 288, Cambridge University Press (2001), 269–301.Google Scholar
73. L., Zhang and B., Wu, Edge choosability of planar graphs without small cycles, Discrete Math. 283 (2004), 289–293.Google Scholar
74. L., Xiaofang, The 4-choosability of toroidal graphs without intersecting triangles, Inform. Process. Lett. 102 (2007), 85–91.Google Scholar
75. B., Xu, (4m,m)-choosability of plane graphs, J. Systems Sci. Complexity 14 (2001), 174–178.Google Scholar
76. B., Xu, On structure of graphs embedded on surfaces of nonnegative characteristic with application to choosability, Discrete Math. 248 (2002), 283–291.Google Scholar

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×