Abstract
A new approach is suggested to the study of the chromatic uniqueness of complete multipartite graphs. The approach is based on the natural lattice order introduced for such graphs. It is proved that atoms with nonelemental partite sets are chromatically unique in the lattice of complete t-partite n-graphs for any given positive integers n and t.
Similar content being viewed by others
References
R. C. Read, J. Comb. Theory 4, 52 (1968).
M. O. Asanov, V. A. Baranskii, and V. V. Rasin, Discrete Mathematics: Graphs, Matroids, Algorithms (Regulyarnaya Khaotich. Dinamika, Izhevsk, 2001) [in Russian].
E. J. Farrell, Discrete Math. 29, 257 (1980).
V. A. Baranskii and S. V. Vikharev, Izv. Ural’sk. Univ.: Ser. Math. Mekh. 7(36), 25 (2005).
K. M. Koh and K. L. Teo, Graphs Combin. 6, 259 (1990).
R. C. Read and W. T. Tutte, in Selected Topics in Graph Theory III (Academic, New York, 1988), pp. 15–42.
K. M. Koh and K. L. Teo, Discrete Math., 172, 59 (1997).
G. L. Chia, Discrete Math. 172, 39 (1997).
H. Zhao, Chromaticity and Adjoint Polynomials of Graphs (Wöhrmann, Zutphen, 2005).
G. Andrews, The Theory of Partitions (Addison-Wesley, London, 1976; Nauka, Moscow, 1982).
G. Grätzer, General Lattice Theory (Academic, New York, 1978; Mir, Moscow, 1982).
C. Y. Chao and G. A. Novacky, Jr., Discrete Math. 41, 139 (1982).
Author information
Authors and Affiliations
Additional information
Original Russian Text © V.A. Baranskii, T.A. Koroleva, 2007, published in Trudy Instituta Matematiki i Mekhaniki UrO RAN, 2007, Vol. 13, No. 3.
Rights and permissions
About this article
Cite this article
Baranskii, V.A., Koroleva, T.A. Chromatic uniqueness of atoms in lattices of complete multipartite graphs. Proc. Steklov Inst. Math. 261 (Suppl 1), 15–23 (2008). https://doi.org/10.1134/S008154808050027
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S008154808050027