Colorability of P5-Free Graphs

ISBN-13: 9783838373676 / Angielski / Miękka / 2010 / 112 str.

Zebin Wang

Opis

This paper considers the question of whether or not a P5-free graph can be 4-colored in polynomial time. It is known that a connected P5-free graph G must have either a dominating clique or a dominating P3. Thus, when considering the 4-coloring question, we have three cases of interest: either G has a dominating K4, a dominating K3, or a dominating P3. In this paper, we demonstrate a polynomial time approach for determining whether or not a P5-free graph G with a dominating K4 can be 4-colored.

O autorze

Currently, work for a financial institution as senior developer in Toronto, ON. Canada. From Jan.2003 to Jun.2005, major in Computing & Information Science at University of Guelph in Canada, received Master Degree. From Sept.1990 to Jul.1994, major in Computer Science at Civil Aviation Institute of China, received Bachelor Degree.