An attempt to classify bipartite graphs by chromatic polynomials

DOI10.1016/S0012-365X(00)00007-8zbMath0963.05055OpenAlexW2126265554MaRDI QIDQ1579550

Michael D. Hendy, Kee L. Teo, Khee Meng Koh, Fengming Dong, Charles H. C. Little

Publication date: 14 September 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00007-8

zbMATH Keywords

bipartite graphchromatically unique

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

This page was built for publication: An attempt to classify bipartite graphs by chromatic polynomials