Linked-cluster expansion of the graph-vertex coloration problem

DOI10.1016/0095-8956(71)90046-3MaRDI QIDQ2533376zbMATH OpenOpenAlexFDO

Authors 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

Cites work

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

Cited in

(6)

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

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

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