1. 毕业设计（论文）的内容和要求
图论（Graph Theory）是数学的一个分支，也是一门新兴学科，发展迅速而又应用广泛。
它已广泛应用于物理、化学、运筹学、计算机科学、电子学、信息论、控制论、网络管理、社会科学等几乎所有的科学领域，另一方面，随着这些学科的发展，特别是计算机科学的快速发展，又大大的促进了图论的发展。
图论中的染色问题十分经典，它最初源于人们对四色猜想的证明的尝试。
2. 参考文献
[1] N. Alon, Degrees and choice numbers, Random Structures 368. [2] A. Bernshteyn. The asymptotic behavior of the correspondence chromatic number, Discrete Math., 339(2016) 26802692. [3] A. Bernshteyn, The JohanssonMolloy Theorem for DP-Coloring, arXiv:1708.03843. [4] A. Bernshteyn, A. Kostochka, On difffferences between DP-coloring and list coloring, arXiv:1705.04883. [5] A. Bernshteyn, A. Kostochka, Sharp Diracs Theorem for DP-Critical Graphs, J. Graph Theory, 88(2018), 521-546. [6] A. Bernshteyn, A. Kostochka, S. Pron, On DP-coloring of graphs and multigraphs, Siberian Mathematical Journal, 58(2017), 2836 [7] A. Bernshteyn, A. Kostochka, X. Zhu, DP-colorings of graphs with high chromatic number, European J. of Comb., 65(2017), 122-129. [8] O. Borodin, Colorings of plane graphs: A survey, Discrete. Math., 313(2013), 517-539. [9] Z. Dvoˇrak, L. Postle, Correspondence coloring and its application to list-coloring planar graphs without cycles of length 4 to 8, J. Combin. Theory Ser. B, 129(2018), 3854. [10] P. Erdos, A. Rubin, H.Taylor, Choosability in graphs, Congr. Numer., 26(1979) 125157. [11] H. Grotzsch, Ein Dreifarbensatz fur Dreikreisfreie Netze auf der Kugel, Math.-Natur. Reihe 8(1959) 109-120. [12] S.-J. Kim, K. Ozeki, A note on a Brooks type theorem for DP-coloring, arXiv:1709.09807v1. [13] S.-J. Kim, K. Ozeki, A suffiffifficient condition for DP-4-colorability, Discrete Math., 341(2018) 19831986. [14] S.-J. Kim, X. Yu, Planar graphs without 4-cycles adjacent to triangles are DP-4-colorable, arXiv:1712.08999 [15] C. Lam, W. Shiu, Z. Song, The 3-choosability of plane graphs of girth 4, Discrete Math, 294(2005) 297-301. [16] X. Li, M. Chen, and Y. Wang, On 3-choosability of planar graphs without 5-, 6- or 7-cycles.Adv. Math. (China) 45(2016) 491-499.[17] B. Lidicky, On 3-choosability of plane graphs having no 3-, 6-, 7- and 8-cycles, Australasian Journal of Combinatorics, 44(2009) 77-86. [18] R. Liu, X. Li, K. Nakprasit, P. Sittitrai, G. Yu, DP-4-colorability of planar graphs without given two adjacent cycles, submitted. [19] C. Thomassen, Every planar graph is 5-choosable, J. Combin. Theory Ser. B, 62(1994) 180181. [20] C. Thomassen, 3-list-coloring planar graphs of girth 5, J. Combin. Theory Ser. B, 64(1995) 101107. [21] V. Vizing, Vertex colorings with given colors, Metody Diskret. Analiz, Novosibirsk, 29(1976) 3-10(in Russian). [22] M. Voigt, List coloring of planar graphs, Discrete Math., 120(1993) 215219. [23] M. Voigt, A not 3-choosable planar graph without 3-cycles, Discrete Math., 146(1995) 325328. [24] L. Zhang, B. Wu, Three-choosable planar graphs without certain small cycles, Graph Theory Notes of New York, 46(2004) 27-30. [25] L. Zhang, B. Wu, A note on 3-choosability of planar graphs without certain cycles, Discrete Math, 297(2005) 206209.[26] 屈婉玲，耿素云，张立昂，离散数学（第2版）北京：高等教育出版社，2015.[27] 耿素云，屈婉玲，王捍贫.离散数学教程[M].北京：北京大学出版社，2002.[28] 屈婉玲，耿素云，王捍贫，等.离散数学习题解析[M].北京：北京大学出版社，2008.[29] Woodcock J,Loomes M. Software Engineering Mathematics[M].London:Pitman Publishing,1988.[30] Cormen T H,Leiserson C E,Rivest R L,et al.Introduction to Algorithms[M].2nd ed.影印版。
北京：高等教育出版社，2002.[31] Kleinberg J,Tardos E.Algorithm Design[M].影印版.北京：清华大学出版社，2006.[32] Rosen K H.Discrete Mathmatics and Its Application[M].影印版.北京：机械工业出版社，2004.
以上是毕业论文任务书，课题毕业论文、开题报告、外文翻译、程序设计、图纸设计等资料可联系客服协助查找。
