The 3-connectivity of a graph and the multiplicity of zero “2” of its chromatic polynomial
From MaRDI portal
Publication:2897206
DOI10.1002/jgt.20614zbMath1244.05132OpenAlexW1568279347MaRDI QIDQ2897206
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
Graph polynomials (05C31) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)
Cites Work