Colorability of P5-free Graphs: 4-colorability belongs P for P5-free graphs with a dominating K4 - Softcover
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.
"synopsis" may belong to another edition of this title.
About the Author
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.
"About this title" may belong to another edition of this title.
Search results for Colorability of P5-free Graphs: 4-colorability belongs...
Seller Image
Colorability of P5-free Graphs
Published by
LAP LAMBERT Academic Publishing Jun 2010, 2010
ISBN 10: 3838373677
ISBN 13: 9783838373676
New
Taschenbuch
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 112 pp. Englisch. Seller Inventory # 9783838373676
Seller Image
Colorability of P5-free Graphs
Published by
LAP LAMBERT Academic Publishing, 2010
ISBN 10: 3838373677
ISBN 13: 9783838373676
New
Softcover
Seller: moluna, Greven, Germany
Seller rating 5 out of 5 stars
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: wang zebinCurrently, 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 . Seller Inventory # 5417671
Buy New
£ 36.89
£ 42.75 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: Over 20 available
Seller Image
Colorability of P5-free Graphs
Published by
LAP LAMBERT Academic Publishing Jun 2010, 2010
ISBN 10: 3838373677
ISBN 13: 9783838373676
New
Taschenbuch
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 112 pp. Englisch. Seller Inventory # 9783838373676
Seller Image
Colorability of P5-free Graphs : 4-colorability belongs P for P5-free graphs with a dominating K4
Published by
LAP LAMBERT Academic Publishing, 2010
ISBN 10: 3838373677
ISBN 13: 9783838373676
New
Taschenbuch
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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. Seller Inventory # 9783838373676
Stock Image
Colorability of P5-free Graphs: 4-colorability belongs P for P5-free graphs with a dominating K4
Published by
LAP LAMBERT Academic Publishing, 2010
ISBN 10: 3838373677
ISBN 13: 9783838373676
Used
paperback
Seller: Mispah books, Redhill, SURRE, United Kingdom
Seller rating 4 out of 5 stars
paperback. Condition: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book. Seller Inventory # ERICA80038383736776