A new subgraph expansion for obtaining coloring polynomials for graphs
From MaRDI portal
Publication:2545522
DOI10.1016/0095-8956(71)90066-9zbMath0215.05505OpenAlexW2021555955MaRDI QIDQ2545522
Publication date: 1971
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(71)90066-9
Related Items
A bibliography on chromatic polynomials, Polynomial sequences of binomial-type arising in graph theory, Potts model and graph theory., Entropy of hard square lattice gas with k distinct species of particles: coloring problems and vertex models, The Potts model and the Tutte polynomial, A little statistical mechanics for the graph theorist, New Graph Polynomials from the Bethe Approximation of the Ising Partition Function, Linked-cluster expansion of the graph-vertex coloration problem, The limit of chromatic polynomials, Expansions of the chromatic polynomial, Chromatic polynomials of homeomorphism classes of graphs, Forests, colorings and acyclic orientations of the square lattice
Cites Work
- The Enumeration of Homeomorphically Irreducible Star Graphs
- An introduction to chromatic polynomials
- [https://portal.mardi4nfdi.de/wiki/Publication:5731810 On the foundations of combinatorial theory I. Theory of M�bius Functions]
