RUS  ENG
Full version
JOURNALS // Trudy Instituta Matematiki i Mekhaniki UrO RAN // Archive

Trudy Inst. Mat. i Mekh. UrO RAN, 2011 Volume 17, Number 2, Pages 159–173 (Mi timm705)

This article is cited in 2 papers

Classification of elements of small height in lattices of complete multipartite graphs

T. A. Senchonok, V. A. Baransky

Ural State University

Abstract: The purpose of the paper is to classify elements of height 2 and 3 in lattices $NPL(n,t)$ of complete multipartite graphs for $t\ge4$. In addition, lower floors of the lattices $NPL(n,t)$ are described and information on two chromatic invariants is specified. This information is used for studying the chromatic uniqueness of complete multipartite graphs.

Keywords: integer partition, lattice, graph, complete multipartite graph, chromatic polynomial, chromatic uniqueness.

UDC: 519.174

Received: 15.03.2011



Bibliographic databases:


© Steklov Math. Inst. of RAS, 2025