An upper bound on adaptable choosability of graphs (Q1003583): Difference between revisions

@@ Property / cites work @@
+Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
+Normal rank
@@ Property / cites work @@
+Q3142409
@@ Property / cites work: Q3142409 / rank @@
+Normal rank
@@ Property / cites work @@
+Adapted list coloring of planar graphs
@@ Property / cites work: Adapted list coloring of planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Full Constraint Satisfaction Problems
@@ Property / cites work: Full Constraint Satisfaction Problems / rank @@
+Normal rank
@@ Property / cites work @@
+List Partitions
@@ Property / cites work: List Partitions / rank @@
+Normal rank
@@ Property / cites work @@
+Q2921752
@@ Property / cites work: Q2921752 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4170745
@@ Property / cites work: Q4170745 / rank @@
+Normal rank
@@ Property / cites work @@
+Adaptable choosability of planar graphs with sparse short cycles
+Normal rank
@@ Property / cites work @@
+On the degrees of the vertices of a directed graph
+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 @@
+Q3139765
@@ Property / cites work: Q3139765 / rank @@
+Normal rank