关于一类完全多部图的Ohba猜想.pdfVIP

Ohba ON OHBA’S CONJECTURE OF ONE CLASS OF COMPLETE MULTIPARTITE GRAPHS ABSTRACT Graph coloring belongs to the classical graph theoretical problemsand has plenty of theoretical results and extencively practical applications. In the latest years, a lot of research papers appeared in the field of restricted colorings of graphs. Restricted coloring of graph is a generalization of general coloring of graph, and list coloring of graph is one of them. In recent decades, list coloring of graph has becoming 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. But for complete multipartite graphs, the graphs for which Ohba’s conjecture has been verified are nothing more than K3,2∗(k−1)(k ≥ 1), Kt+3,2∗(k−t−1),1∗t (k ≥ t + 1), and Kt+2,3,2∗(k−t−2),1∗t (t = 1,2,3,4; k ≥ t + 2). In this paper, we show that graphs Kt+2,3,2∗(k−t−2),1∗t (t is even and t ≥ 6; k ≥ t + 2) are chromatic-choosable. Hence Ohba’s conjecture holds for Kt+2,3,2∗(k−t−2),1∗t (t is even and t ≥ 6; k ≥ t + 2) 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 purpose and meanings of this paper; The