Restraints permitting the largest number of colourings (Q1786873): Difference between revisions

@@ Property / author @@
-Jason I. Brown
@@ Property / author: Jason I. Brown / rank @@
-Normal rank
@@ Property / author @@
+Jason I. Brown
@@ Property / author: Jason I. Brown / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2559029563
@@ Property / OpenAlex ID: W2559029563 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.09536
@@ Property / arXiv ID: 1611.09536 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3142409
@@ Property / cites work: Q3142409 / rank @@
+Normal rank
@@ Property / cites work @@
+Extremal Restraints for Graph Colourings
@@ Property / cites work: Extremal Restraints for Graph Colourings / rank @@
+Normal rank
@@ Property / cites work @@
+Graph coloring satisfying restraints
@@ Property / cites work: Graph coloring satisfying restraints / rank @@
+Normal rank
@@ Property / cites work @@
+Q3525736
@@ Property / cites work: Q3525736 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5313291
@@ Property / cites work: Q5313291 / rank @@
+Normal rank
@@ Property / cites work @@
+On the number of list‐colorings
@@ Property / cites work: On the number of list‐colorings / rank @@
+Normal rank
@@ Property / cites work @@
+Interval vertex-coloring of a graph with forbidden colors
+Normal rank
@@ Property / cites work @@
+Amenable colorings
@@ Property / cites work: Amenable colorings / rank @@
+Normal rank
@@ Property / cites work @@
+The chromatic polynomial and list colorings
@@ Property / cites work: The chromatic polynomial and list colorings / rank @@
+Normal rank
@@ Property / cites work @@
+Colour-critical graphs and hypergraphs
@@ Property / cites work: Colour-critical graphs and hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Graph colorings with local constraints -- a survey
+Normal rank
@@ Property / cites work @@
+When does the list-coloring function of a graph equal its chromatic polynomial
+Normal rank