Extremal H‐Colorings of Graphs with Fixed Minimum Degree (Q5251205): Difference between revisions

@@ Property / cites work @@
+Independent sets in graphs with given minimum degree
+Normal rank
@@ Property / cites work @@
+Extremal graphs for homomorphisms
@@ Property / cites work: Extremal graphs for homomorphisms / rank @@
+Normal rank
@@ Property / cites work @@
+Extremal Graphs for Homomorphisms II
@@ Property / cites work: Extremal Graphs for Homomorphisms II / rank @@
+Normal rank
@@ Property / cites work @@
+The maximum number of complete subgraphs in a graph with given maximum degree
+Normal rank
@@ Property / cites work @@
+\(H\)-colouring bipartite graphs
@@ Property / cites work: \(H\)-colouring bipartite graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Counting Independent Sets of a Fixed Size in Graphs with a Given Minimum Degree
+Normal rank
@@ Property / cites work @@
+Two problems on independent sets in graphs
@@ Property / cites work: Two problems on independent sets in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Maximizing <i>H</i>‐Colorings of a Regular Graph
+Normal rank
@@ Property / cites work @@
+The Multistate Hard Core Model on a Regular Tree
@@ Property / cites work: The Multistate Hard Core Model on a Regular Tree / rank @@
+Normal rank
@@ Property / cites work @@
+The number of independent sets in a graph with small maximum degree
+Normal rank
@@ Property / cites work @@
+An Entropy Approach to the Hard-Core Model on Bipartite Graphs
+Normal rank
@@ Property / cites work @@
+Entropy, independent sets and antichains: A new approach to Dedekind’s problem
+Normal rank
@@ Property / cites work @@
+On Independent Sets in Graphs with Given Minimum Degree
+Normal rank
@@ Property / cites work @@
+On the greatest number of 2 and 3 colorings of a (v, e)-graph
+Normal rank
@@ Property / cites work @@
+Legal coloring of graphs
@@ Property / cites work: Legal coloring of graphs / rank @@
+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 @@
+Markov random field models of multicasting in tree networks
+Normal rank
@@ Property / cites work @@
+Q3066191
@@ Property / cites work: Q3066191 / rank @@
+Normal rank
@@ Property / cites work @@
+Backtrack: An O(1) expected time algorithm for the graph coloring problem
+Normal rank
@@ Property / cites work @@
+The Number of Independent Sets in a Regular Graph
@@ Property / cites work: The Number of Independent Sets in a Regular Graph / rank @@
+Normal rank
@@ Property / cites work @@
+The Bipartite Swapping Trick on Graph Homomorphisms
+Normal rank

Extremal <i>H</i>‐Colorings of Graphs with Fixed Minimum Degree (Q5251205): Difference between revisions

Latest revision as of 03:44, 10 July 2024

Statements

Identifiers

Sitelinks

Mathematics(1 entry)