Linked-cluster expansion for the graph-vertex coloration problem
- 1 June 1971
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 10 (3) , 217-231
- https://doi.org/10.1016/0095-8956(71)90046-3
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Colorings of a Hexagonal LatticeJournal of Mathematical Physics, 1970
- Weak-Graph Method for Obtaining Formal Series Expansions for Lattice Statistical ProblemsJournal of Mathematical Physics, 1968
- Residual Entropy of Square IcePhysical Review B, 1967
- On dichromatic polynomialsJournal of Combinatorial Theory, 1967
- Lattice Constant Systems and Graph TheoryJournal of Mathematical Physics, 1966
- Percolation Processes. I. Low-Density Expansion for the Mean Number of Clusters in a Random MixtureJournal of Mathematical Physics, 1966
- On the Theory of Randomly Dilute Ising and Heisenberg FerromagneticsJournal of Mathematical Physics, 1964
- The Coloring of GraphsAnnals of Mathematics, 1932
- A logical expansion in mathematicsBulletin of the American Mathematical Society, 1932
- A Determinant Formula for the Number of Ways of Coloring a MapAnnals of Mathematics, 1912