Colorability of P5-free Graphs

Colorability of P5-free Graphs


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

₹ 3,651

Availability: Out of stock


Delivery :

5% Cashback on all Orders paid using MobiKwik Wallet T&C

Free Krispy Kreme Voucher on all Orders paid using UltraCash Wallet T&C
Product Out of Stock Subscription

(Notify me when this product is back 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
Country of ManufactureIndia
Product BrandLAP LAMBERT Academic Publishing
Product Packaging InfoBox
In The Box1 Piece
Product First Available On ClickOnCare.com2015-07-25
0 Review(s)