Colorability of P5-Free Graphs

By zebin wang

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... This description may be from another edition of this product.

• Format: Paperback
• Language: English
• ISBN: 3838373677
• ISBN13: 9783838373676
• Release Date: June 2010
• Publisher: LAP Lambert Academic Publishing
• Length: 112 Pages
• Weight: 0.39 lbs.
• Dimensions: 0.3" x 6.0" x 9.0"