Chromatic uniqueness of elements of height \(\leq 3\) in lattices of complete multipartite graphs

DOI10.1134/S0081543812090015zbMath1301.05117MaRDI QIDQ461058

J. Herrera, D. Rodríguez-Gómez

Publication date: 9 October 2014

Published in: Proceedings of the Steklov Institute of Mathematics (Search for Journal in Brave)

zbMATH Keywords

lattice; chromatic polynomial; chromatic uniqueness; complete multipartite graph; integer partition

Mathematics Subject Classification ID

05C31: Graph polynomials

05A17: Combinatorial aspects of partitions of integers

05C15: Coloring of graphs and hypergraphs