Complexity of clique coloring and related problems (Q551168): Difference between revisions

@@ Property / cites work @@
+Coloring the Maximal Cliques of Graphs
@@ Property / cites work: Coloring the Maximal Cliques of Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Clique-coloring some classes of odd-hole-free graphs
+Normal rank
@@ Property / cites work @@
+Two-colouring all two-element maximal antichains
@@ Property / cites work: Two-colouring all two-element maximal antichains / rank @@
+Normal rank
@@ Property / cites work @@
+Q3922703
@@ Property / cites work: Q3922703 / rank @@
+Normal rank
@@ Property / cites work @@
+Coloring the hypergraph of maximal cliques of a graph with no long path
+Normal rank
@@ Property / cites work @@
+The complexity of planar graph choosability
@@ Property / cites work: The complexity of planar graph choosability / rank @@
+Normal rank
@@ Property / cites work @@
+On the divisibility of graphs
@@ Property / cites work: On the divisibility of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of bicoloring clique hypergraphs of graphs
+Normal rank
@@ Property / cites work @@
+Q4276003
@@ Property / cites work: Q4276003 / rank @@
+Normal rank
@@ Property / cites work @@
+The Grötzsch theorem for the hypergraph of maximal cliques
+Normal rank
@@ Property / cites work @@
+Q3221403
@@ Property / cites work: Q3221403 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3115277
@@ Property / cites work: Q3115277 / rank @@
+Normal rank