Linked-cluster expansion of the graph-vertex coloration problem

DOI10.1016/0095-8956(71)90046-3zbMath0175.50204OpenAlexW2078958156MaRDI QIDQ2533376

George A. jun. Baker

Publication date: 1969

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)90046-3

zbMATH Keywords

topology

Related Items (6)

A bibliography on chromatic polynomials ⋮ Polynomial sequences of binomial-type arising in graph theory ⋮ The limit of chromatic polynomials ⋮ Expansions of the chromatic polynomial ⋮ Approximations for chromatic polynomials ⋮ A survey of the asymptotic behaviour of maps

Cites Work

• A new subgraph expansion for obtaining coloring polynomials for graphs
• A logical expansion in mathematics
• On dichromatic polynomials
• Lattice Constant Systems and Graph Theory
• Percolation Processes. I. Low-Density Expansion for the Mean Number of Clusters in a Random Mixture

This page was built for publication: Linked-cluster expansion of the graph-vertex coloration problem