{"product_id":"colorability-of-p5-free-graphs-von-zebin-wang","title":"Colorability of P5-free Graphs","description":"\u003cp\u003eThis 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.\u003c\/p\u003e\u003cdiv class=\"aw-variant-hidden-subtitle-div\" id=\"aw-variant-subtitle-9783838373676\"\u003e\u003ch3\u003e4-colorability belongs P for P5-free graphs with a dominating K4\u003c\/h3\u003e\u003c\/div\u003e","brand":"Autorenwelt Shop","offers":[{"title":"Softcover - 9783838373676","offer_id":39498917150813,"sku":"9783838373676","price":49.0,"currency_code":"EUR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0940\/0622\/files\/c7c98c55-7403-4197-8d57-90610f719b0f.jpg?v=1769667905","url":"https:\/\/shop.autorenwelt.de\/products\/colorability-of-p5-free-graphs-von-zebin-wang","provider":"Autorenwelt Shop","version":"1.0","type":"link"}