A new subgraph expansion for obtaining coloring polynomials for graphs

DOI10.1016/0095-8956(71)90066-9MaRDI QIDQ2545522zbMATH OpenOpenAlexFDO

Authors John F. Nagle

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

Mathematics Subject Classification ID

Distance in graphs (05C12)

Cites work

• An introduction to chromatic polynomials
• On the foundations of combinatorial theory I. Theory of M�bius Functions
• The Enumeration of Homeomorphically Irreducible Star Graphs

Cited in

(12)

• Chromatic polynomials of homeomorphism classes of graphs
• Forests, colorings and acyclic orientations of the square lattice
• A bibliography on chromatic polynomials
• Potts model and graph theory.
• Linked-cluster expansion of the graph-vertex coloration problem
• The Potts model and the Tutte polynomial.
• New graph polynomials from the Bethe approximation of the Ising partition function
• Entropy of hard square lattice gas with k distinct species of particles: coloring problems and vertex models
• Polynomial sequences of binomial-type arising in graph theory
• The limit of chromatic polynomials
• Expansions of the chromatic polynomial
• A little statistical mechanics for the graph theorist

This page was built for publication: A new subgraph expansion for obtaining coloring polynomials for graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2545522)