On r-hued colorings in graphs under forbidden subgraph conditions
Lecture | May 23, 2017 | 10:00 a.m. | 224 Room in Nanhai Building

Speaker: HONG Jian-lai West Virginia University

ABOUT HONG JIANLAI
Professor Hong is Department of Mathematics, University of West Virginia, USA. The main research areas are graph theory. He served as Discrete Mathematics magazine guest editor, the current Graph and Combinatorics and Journal of Discrete Mathematics magazine editorial board and has published three monographs and academic papers more than 180.

ABOUT THE LECTURE
R-hued colorings of graphs are natural generalizations of classic graph colorings. It is known that the difference between r-hued chromatic number $chi_r(G)$ and the classic chromatic number $chi(G)$ can be arbitrarily large. Therefore, it is of interests to find graph families in which the $r$-hued chromatic number $chi_r(G)$ is bounded above by a function of $r$ and $chi(G)$ plus some of the characteristics of the graph family. In this talk, we will present results of this type when the graph families are graphs without induced $K_{1,3}$, without induced paths on 4 or 5 vertices.