一类完全多部图的色-可选性研究.pdf

‡Ûíåa¨†ÿ© òaı‹„⁄)å¿5Ôƒ £ á L/⁄ØK§è.âåSØı„ÿˆÔƒ9:Éò ©ÃáÔƒL/⁄•u „⁄)å¿5ØKXJ„G ˜v Ch(G) (G) ßK°G ¥⁄)å¿Ju„⁄)å¿5ß2002 c Ohba â —flé µXJ„G ˜v V(G) 2 (G) 1ßKG ¥⁄)å¿J N¥uy Ohba fl駷Ö=ŸÈı‹„§·ß¥È ı‹„Ohba fléyúêkAa „©yµı‹„ Ks33t2(ks2t1)1(ts) £t 0; k s 2t 1; 2 s 5 §¥⁄)å¿J„ œdßÈ„Ks33t2(ks2t1)1(ts) £t 0; k s 2t 1; 2 s 5 §9 Ÿ§k k-⁄f„Ohba fl駷 ©ò© Ÿµ1òŸèXÿßÃá0„ÿu–§⁄©Ô ƒ89ø¬1Ÿè˝£ß0„òƒ£⁄ƒ Vg1nŸ0⁄)å¿5ÔƒyG9 Æk(J1oŸy òaı‹„¿JÍßÈŸyOhba flé(51 Ÿ è(ÿßo(ÿ©ÃáÔƒSN⁄(J Öc: L/⁄ß⁄)å¿5ßOhba fléßı‹„ i òaı‹„⁄)å¿5Ôƒ ON CHROMATIC-CHOOSABLE OF A CLASS OF COMPLETE MULTIPARTITE GRAPHS ABSTRACT List coloring of graph has become one of the hottest researching points for many scientists in the world. In this paper, we study the chromatic-choosability of graphs on list coloring. A graph G is called chromatic-choosable if Ch(G) (G). For the choosability of graphs, Ohba conjectured that every graph G with 2 (G)1 or fewer vertices is chromatic-choosable in 2002. It is easy to see that Ohba’s conjecture holds if and only if it holds for complete multipartite graphs. The graph for which Ohba’s conjecture has been verified are some complete multipartite graphs. In this paper, we show that graphs Ks33t2(ks2t1)1(ts) £t 0; k s 2t 1; 2 s 5 §are chromatic-choosable. Hence Ohba’s conjecture holds for Ks33t2(ks2t1)1(ts) £t 0; k s 2t 1; 2 s 5 §and all k-chromatic subgraphs of them. This paper includes five chapters: The first chapter is introduction, introducing the phylogeny of graph theory, and the researching p