The 3-connectivity of a graph and the multiplicity of zero “2” of its chromatic polynomial

DOI10.1002/jgt.20614zbMath1244.05132MaRDI QIDQ2897206

Khee Meng Koh, Fengming Dong

Publication date: 10 July 2012

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

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

zbMATH Keywords

connectivity; chromatic polynomial; chromatic zero

Mathematics Subject Classification ID

05C31: Graph polynomials

05C75: Structural characterization of families of graphs

05C15: Coloring of graphs and hypergraphs

05C40: Connectivity