A new subgraph expansion for obtaining coloring polynomials for graphs
- 1 February 1971
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 10 (1) , 42-59
- https://doi.org/10.1016/0095-8956(71)90066-9
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Weak-Graph Method for Obtaining Formal Series Expansions for Lattice Statistical ProblemsJournal of Mathematical Physics, 1968
- An introduction to chromatic polynomialsJournal of Combinatorial Theory, 1968
- Residual Entropy of Square IcePhysical Review B, 1967
- The Enumeration of Homeomorphically Irreducible Star GraphsJournal of Mathematical Physics, 1966
- On the foundations of combinatorial theory I. Theory of M bius FunctionsProbability Theory and Related Fields, 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