Maximizing the number of \(x\)-colorings of 4-chromatic graphs (Q1709544): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2539760540
@@ Property / OpenAlex ID: W2539760540 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.07219
@@ Property / arXiv ID: 1610.07219 / rank @@
+Normal rank
@@ Property / cites work @@
+New bounds for chromatic polynomials and chromatic roots
+Normal rank
@@ Property / cites work @@
+On the chromatic roots of generalized theta graphs
+Normal rank
@@ Property / cites work @@
+Q5313291
@@ Property / cites work: Q5313291 / rank @@
+Normal rank
@@ Property / cites work @@
+Maximizing <i>H</i>‐Colorings of Connected Graphs with Fixed Minimum Degree
+Normal rank
@@ Property / cites work @@
+Extremal \(H\)-colorings of trees and 2-connected graphs
+Normal rank
@@ Property / cites work @@
+On the maximum number of colorings of a graph
@@ Property / cites work: On the maximum number of colorings of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+A strengthening of the Kuratowski planarity criterion for 3-connected graphs
+Normal rank
@@ Property / cites work @@
+Maximizing the number of <i>q</i> -colorings
@@ Property / cites work: Maximizing the number of <i>q</i> -colorings / rank @@
+Normal rank
@@ Property / cites work @@
+Maximizing proper colorings on graphs
@@ Property / cites work: Maximizing proper colorings on graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Typical subgraphs of 3- and 4-connected graphs
@@ Property / cites work: Typical subgraphs of 3- and 4-connected graphs / rank @@
+Normal rank
@@ Property / cites work @@
+An Extremal Property of Turán Graphs, II
@@ Property / cites work: An Extremal Property of Turán Graphs, II / rank @@
+Normal rank
@@ Property / cites work @@
+Q5628155
@@ Property / cites work: Q5628155 / rank @@
+Normal rank
@@ Property / cites work @@
+Maximal chromatic polynomials of connected planar graphs
+Normal rank
@@ Property / cites work @@
+The Bipartite Swapping Trick on Graph Homomorphisms
+Normal rank