Báo cáo khoa học 演講訊息

Given a graph G, a function f:V(G)→N is called a coloring of G.Let f be a coloring of G and let H be a subgraph of G, we define , and we let S(f)= fS (G). A coloring f of G is called an IC- coloring of G if for any integer k ∈ [1, fS (G) ] there is a connected subgraph H of G such that fS(H)= k. The IC-index of G, denoted by M(G), is defined to be M(G)= max{S(f): f is an IC- coloring of G}. In this talk, I will introduce some previous works about this problem.