Call Us 080-41656200 (Mon-Sat: 10AM-8PM)
Free Shipping above Rs. 1499
Cash On Delivery*

Colorability of P5-free Graphs

 

Marketed By :  LAP LAMBERT Academic Publishing   Sold By :  Kamal Books International  
Delivery in :  10-12 Business Days

 

Check Your Delivery Options

 
Rs. 3,651

Availability: In stock

 
  • Product Description
 

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.

Product Specifications
SKU :COC16376
Authorzebin wang
LanguageEnglish
BindingPaperback
Number of Pages112
Publishing Year6/14/2010
ISBN978-3838373676
Edition1 st
Book TypeMathematics
Country of ManufactureIndia
Product BrandLAP LAMBERT Academic Publishing
Product Packaging InfoBox
In The Box1 Piece
Product First Available On ClickOnCare.com2015-07-25 00:00:00