Linked-cluster expansion of the graph-vertex coloration problem (Q2533376): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0095-8956(71)90046-3
+Normal rank
@@ Property / OpenAlex ID @@
+W2078958156
@@ Property / OpenAlex ID: W2078958156 / rank @@
+Normal rank
@@ Property / cites work @@
+A logical expansion in mathematics
@@ Property / cites work: A logical expansion in mathematics / rank @@
+Normal rank
@@ Property / cites work @@
+Lattice Constant Systems and Graph Theory
@@ Property / cites work: Lattice Constant Systems and Graph Theory / rank @@
+Normal rank
@@ Property / cites work @@
+Percolation Processes. I. Low-Density Expansion for the Mean Number of Clusters in a Random Mixture
+Normal rank
@@ Property / cites work @@
+On dichromatic polynomials
@@ Property / cites work: On dichromatic polynomials / rank @@
+Normal rank
@@ Property / cites work @@
+A new subgraph expansion for obtaining coloring polynomials for graphs
+Normal rank