On the complexity of bicoloring clique hypergraphs of graphs

DOI10.1016/S0196-6774(02)00221-3zbMath1030.68066MaRDI QIDQ4806592

Zsolt Tuza, Jan Kratochvíl

Publication date: 14 May 2003

Published in: Journal of Algorithms (Search for Journal in Brave)

zbMATH Keywords

clique hypergraph

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

Related Items

Colouring clique-hypergraphs of circulant graphs, Colouring clique-hypergraphs of circulant graphs, Restricted coloring problems on graphs with few \(P_4\)'s, Biclique-colouring verification complexity and biclique-colouring power graphs, Coloring clique-hypergraphs of graphs with no subdivision of \(K_5\), Clique coloring \(B_1\)-EPG graphs, Lower bounds for positive semidefinite zero forcing and their applications, A linear-time algorithm for clique-coloring problem in circular-arc graphs, Efficient algorithms for clique-colouring and biclique-colouring unichord-free graphs, Complexity of clique coloring and related problems, The chain graph sandwich problem, Balanced vertex-orderings of graphs, Hitting all maximal independent sets of a bipartite graph, Clique-transversal sets and clique-coloring in planar graphs, Clique-coloring claw-free graphs, Hierarchical complexity of 2-clique-colouring weakly chordal graphs and perfect graphs having cliques of size at least 3, Clique-Coloring Circular-Arc Graphs, On star and biclique edge-colorings, On Making Directed Graphs Transitive, Positive Semidefinite Zero Forcing: Complexity and Lower Bounds, Clique-coloring UE and UEH graphs, Subgraph-avoiding coloring of graphs, Complexity of clique-coloring odd-hole-free graphs