On the complexity of bicoloring clique hypergraphs of graphs
From MaRDI portal
Publication:4806592
DOI10.1016/S0196-6774(02)00221-3zbMath1030.68066MaRDI QIDQ4806592
Publication date: 14 May 2003
Published in: Journal of Algorithms (Search for Journal in Brave)
68R10: Graph theory (including graph drawing) in computer science
Related Items
Colouring clique-hypergraphs of circulant graphs, Colouring clique-hypergraphs of circulant graphs, Complexity of clique coloring and related problems, The chain graph sandwich problem, Balanced vertex-orderings of graphs, Clique-Coloring Circular-Arc Graphs, On Making Directed Graphs Transitive, Clique-coloring UE and UEH graphs, Subgraph-avoiding coloring of graphs, Complexity of clique-coloring odd-hole-free graphs