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

Standard

Chromatic uniqueness of elements of height ≤ 3 in lattices of complete multipartite graphs. / Baranskii, V. A.; Sen'chonok, T. A.
In: Proceedings of the Steklov Institute of Mathematics, Vol. 279, No. 1, 12.2012, p. 1-16.

Research output: Contribution to journal › Article › peer-review

BibTeX

@article{86dd25a145a5496caec56f5b8c9aa3d3,

title = "Chromatic uniqueness of elements of height ≤ 3 in lattices of complete multipartite graphs",

keywords = "integer partition, lattice, graph, complete multipartite graph, chromatic polynomial, chromatic uniqueness",

author = "Baranskii, {V. A.} and Sen'chonok, {T. A.}",

year = "2012",

month = dec,

doi = "10.1134/S0081543812090015",

language = "English",

volume = "279",

pages = "1--16",

journal = "Proceedings of the Steklov Institute of Mathematics",

issn = "0081-5438",

publisher = "Pleiades Publishing",

number = "1",

}

RIS

TY - JOUR

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

AU - Baranskii, V. A.

AU - Sen'chonok, T. A.

PY - 2012/12

Y1 - 2012/12

KW - integer partition

KW - lattice

KW - graph

KW - complete multipartite graph

KW - chromatic polynomial

KW - chromatic uniqueness

UR - http://www.scopus.com/inward/record.url?scp=84871348242&partnerID=8YFLogxK

UR - https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=tsmetrics&SrcApp=tsm_test&DestApp=WOS_CPL&DestLinkType=FullRecord&KeyUT=000312634700001

UR - https://elibrary.ru/item.asp?id=24580439

U2 - 10.1134/S0081543812090015

DO - 10.1134/S0081543812090015

M3 - Article

AN - SCOPUS:84871348242

VL - 279

SP - 1

EP - 16

JO - Proceedings of the Steklov Institute of Mathematics

JF - Proceedings of the Steklov Institute of Mathematics

SN - 0081-5438

IS - 1

ER -

ID: 1067542