Complexity of conditional colorability of graphs
type: Item
instance of: scholarly article
title: Complexity of conditional colorability of graphs
zbMATH Open document ID: 1188.05064
author: Xiangmei Yao
author: Wenli Zhou
author: Xueliang Li
author: Hajo Broersma
published in: Applied Mathematics Letters
publication date: 2009-03-04T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 5523293
zbMATH Keywords: vertex coloring
zbMATH Keywords: conditional coloring
zbMATH Keywords: (Conditional) chromatic number
zbMATH Keywords: algorithm
zbMATH Keywords: complexity
zbMATH Keywords: \(NP\)-complete
MaRDI profile type: Publication
full work available at URL: j.aml.2008.04.003
OpenAlex ID: W2149858405
cites work: Q5422499
cites work: Graph-Theoretic Concepts in Computer Science
cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
cites work: Q4198056
cites work: Some simplified NP-complete graph problems
cites work: Q3328583
cites work: Conditional colorings of graphs
cites work: Q5466088
DOI: 10.1016/J.AML.2008.04.003
description: scientific article; zbMATH DE number 5523293