Perfect graphs of arbitrarily large clique-chromatic number (Q896010): Difference between revisions

@@ Property / DOI @@
-.1016/j.jctb.2015.09.008
@@ Property / DOI: 10.1016/j.jctb.2015.09.008 / rank @@
-Normal rank
@@ Property / cites work @@
+Clique-transversal sets of line graphs and complements of line graphs
+Normal rank
@@ Property / cites work @@
+Coloring the Maximal Cliques of Graphs
@@ Property / cites work: Coloring the Maximal Cliques of Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Decomposing and Clique‐Coloring (Diamond, Odd‐Hole)‐Free Graphs
+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 @@
+Coloring the hypergraph of maximal cliques of a graph with no long path
+Normal rank
@@ Property / cites work @@
+The Grötzsch theorem for the hypergraph of maximal cliques
+Normal rank
@@ Property / cites work @@
+Sur le coloriage des graphs
@@ Property / cites work: Sur le coloriage des graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5790850
@@ Property / cites work: Q5790850 / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.JCTB.2015.09.008
@@ Property / DOI: 10.1016/J.JCTB.2015.09.008 / rank @@
+Normal rank