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

Wang, Zebin

 
9783838373676: Colorability of P5-free Graphs: 4-colorability belongs P for P5-free graphs with a dominating K4
Softcover
ISBN 10: 3838373677 ISBN 13: 9783838373676
Verlag: LAP LAMBERT Academic Publishing, 2010

Inhaltsangabe

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.

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.

Über die Autorin bzw. den Autor

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.

„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.

Verlag
LAP LAMBERT Academic Publishing
Erscheinungsdatum
2010
Sprache
Englisch
ISBN 10 
3838373677
ISBN 13 
9783838373676
Einband
Taschenbuch
Anzahl der Seiten
112
Kontakt zum Hersteller
Nicht verfügbar
Verantwortliche Person
Fastbook Publishing
customerservice@vdm-vsg.de

Brivibas gatve 197
Riga
1039
Lettland