Single‐conflict colouring (Q6055933): Difference between revisions

@@ Property / cites work @@
+Colorings and orientations of graphs
@@ Property / cites work: Colorings and orientations of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The asymptotic behavior of the correspondence chromatic number
+Normal rank
@@ Property / cites work @@
+The local cut lemma
@@ Property / cites work: The local cut lemma / rank @@
+Normal rank
@@ Property / cites work @@
+Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
+Normal rank
@@ Property / cites work @@
+Q3922703
@@ Property / cites work: Q3922703 / rank @@
+Normal rank
@@ Property / cites work @@
+Separation Choosability and Dense Bipartite Induced Subgraphs
+Normal rank
@@ Property / cites work @@
+Choosability with Separation of Complete Multipartite Graphs and Hypergraphs
+Normal rank
@@ Property / cites work @@
+On the adaptable chromatic number of graphs
@@ Property / cites work: On the adaptable chromatic number of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Adapted List Coloring of Graphs and Hypergraphs
@@ Property / cites work: Adapted List Coloring of Graphs and Hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+A note on group colorings
@@ Property / cites work: A note on group colorings / rank @@
+Normal rank
@@ Property / cites work @@
+Brooks-type theorems for choosability with separation
+Normal rank
@@ Property / cites work @@
+Complexity of choosing subsets from color sets
@@ Property / cites work: Complexity of choosing subsets from color sets / rank @@
+Normal rank
@@ Property / cites work @@
+Graph colouring and the probabilistic method
@@ Property / cites work: Graph colouring and the probabilistic method / rank @@
+Normal rank
@@ Property / cites work @@
+Q2716011
@@ Property / cites work: Q2716011 / rank @@
+Normal rank