Articles liés à Colorability of P5-free Graphs: 4-colorability belongs...

Colorability of P5-free Graphs: 4-colorability belongs P for P5-free graphs with a dominating K4 - Couverture souple

Wang, Zebin

 
9783838373676: Colorability of P5-free Graphs: 4-colorability belongs P for P5-free graphs with a dominating K4

Synopsis

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.

Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.

Présentation de l'éditeur

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.

Biographie de l'auteur

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.

Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.