Three complexity results on coloring \(P_k\)-free graphs
type: Item
instance of: scholarly article
title: Three complexity results on coloring \(P_k\)-free graphs
zbMATH Open document ID: 1257.05037
author: Fedor V. Fomin
author: Daniël Paulusma
author: Hajo Broersma
author: Petr A. Golovach
published in: European Journal of Combinatorics
publication date: 2013-01-24T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 6128660
zbMATH Keywords: dominating clique
zbMATH Keywords: polynomial-time algorithm
zbMATH Keywords: path free graphs
zbMATH Keywords: vertex colouring problems
zbMATH Keywords: pre-colouring extension
zbMATH Keywords: polymial solvability
MaRDI profile type: Publication
full work available at URL: j.ejc.2011.12.008
OpenAlex ID: W2159829425
Wikidata QID: Q60488525
DOI: 10.1016/J.EJC.2011.12.008
description: scientific article; zbMATH DE number 6128660