Maximal σ‐polynomials of connected 3‐chromatic graphs

DOI10.1002/jgt.10115zbMath1024.05032OpenAlexW4241944625MaRDI QIDQ4416305

Ioan Tomescu

Publication date: 31 July 2003

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.10115

zbMATH Keywords

posetchromatic polynomialStirling number of the second kindbicyclic graph\(\sigma\)-polynomialunlabeled graphconnected 3-chromatic graphdiagram of a posetmaximal number of 3-color partitions

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (2)

On the Roots of σ-Polynomials ⋮ Extremal bicyclic 3-chromatic graphs

This page was built for publication: Maximal σ‐polynomials of connected 3‐chromatic graphs