Chromatic uniqueness of elements of height \(\leq 3\) in lattices of complete multipartite graphs
type: Item
instance of: scholarly article
title: Chromatic uniqueness of elements of height \(\leq 3\) in lattices of complete multipartite graphs
zbMATH Open document ID: 1301.05117
DOI: 10.1134/S0081543812090015
published in: Proceedings of the Steklov Institute of Mathematics
publication date: 2014-10-09T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C31
Mathematics Subject Classification ID: 05A17
zbMATH DE Number: 6353230
zbMATH Keywords: integer partition
zbMATH Keywords: lattice
zbMATH Keywords: complete multipartite graph
zbMATH Keywords: chromatic polynomial
zbMATH Keywords: chromatic uniqueness
MaRDI profile type: Publication
cites work: Q4146776
cites work: The lattice of partitions of a positive integer
cites work: An introduction to chromatic polynomials
cites work: On maximally saturated graphs
cites work: The search for chromatically unique graphs
cites work: On chromatic coefficients
Recommended article: Q5435947
Recommended article: Q3450089
Recommended article: Chromatic uniqueness of certain complete tripartite graphs
Recommended article: Q3403635
Recommended article: Chromatic uniqueness of atoms in lattices of complete multipartite graphs
Recommended article: About chromatic uniqueness of some complete tripartite graphs
Recommended article: ON CHROMATIC UNIQUENESS OF SOME COMPLETE TRIPARTITE GRAPHS
Recommended article: Chromatic uniqueness of a kind of complete tripartite graph
Recommended article: Q3450091
Recommended article: Q3014375
author: V. A. Baranskii
author: T. A. Sen'chonok
description: scientific article; zbMATH DE number 6353230