Complexity of clique coloring and related problems
type: Item
instance of: scholarly article
title: Complexity of clique coloring and related problems
zbMATH Open document ID: 1222.05070
author: Dániel Marx
published in: Theoretical Computer Science
publication date: 2011-07-14T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 5920426
zbMATH Keywords: clique coloring
zbMATH Keywords: choosability
zbMATH Keywords: complexity
zbMATH Keywords: polynomial hierarchy
MaRDI profile type: Publication
full work available at URL: j.tcs.2011.02.038
OpenAlex ID: W2026705714
cites work: Coloring the Maximal Cliques of Graphs
cites work: Clique-coloring some classes of odd-hole-free graphs
cites work: Two-colouring all two-element maximal antichains
cites work: Q3922703
cites work: Coloring the hypergraph of maximal cliques of a graph with no long path
cites work: The complexity of planar graph choosability
cites work: On the divisibility of graphs
cites work: On the complexity of bicoloring clique hypergraphs of graphs
cites work: Q4276003
cites work: The Grötzsch theorem for the hypergraph of maximal cliques
cites work: Q3221403
cites work: Q3115277
DOI: 10.1016/J.TCS.2011.02.038
description: scientific article; zbMATH DE number 5920426