Chromatic uniqueness of elements of height ≤ 3 in lattices of complete multipartite graphs

Original language	English
Pages (from-to)	1-16
Number of pages	16
Journal	Proceedings of the Steklov Institute of Mathematics
Volume	279
Issue number	1
DOIs	https://doi.org/10.1134/S0081543812090015
Publication status	Published - Dec 2012

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

ID: 1067542