The local chromatic number of a graph was introduced in [14]. It is in between the chromatic and fractional chromatic numbers. This motivates the study of the local chromatic number of graphs for which these quantities are far apart. Such graphs include Kneser graphs, their vertex color-critical subgraphs, the Schrijver (or stable Kneser) graphs; Mycielski graphs, and their generalizations; and Borsuk graphs. We give more or less tight bounds for the local chromatic number of many of these graphs.
机构:
Laboratory of Applied Mathematics and Computing, PTIT, HanoiLaboratory of Applied Mathematics and Computing, PTIT, Hanoi
Anh P.N.
Thuy L.Q.
论文数: 0引用数: 0
h-index: 0
机构:
School of Applied Mathematics and Informatics, Hanoi University of Science and Technology, HanoiLaboratory of Applied Mathematics and Computing, PTIT, Hanoi
Thuy L.Q.
Anh T.T.H.
论文数: 0引用数: 0
h-index: 0
机构:
Department of Mathematics, Haiphong University, Hai PhongLaboratory of Applied Mathematics and Computing, PTIT, Hanoi
机构:
Calif State Univ Los Angeles, Dept Math & Comp Sci, Los Angeles, CA 90032 USACalif State Univ Los Angeles, Dept Math & Comp Sci, Los Angeles, CA 90032 USA