In: Mathematica Slovaca, vol. 60, no. 4
S. K. Nimbhokar - M. P. Wasadikar - M. M Pawar
Details:
Year, pages: 2010, 419 - 434
Keywords:
coloring of a lattice, clique number, chromatic number, atom, atomic lattice, complemented lattice, annihilator, ideal
About article:
The concept of coloring is studied for graphs derived from lattices with $0$. It is shown that, if such a graph is derived from an atomic or distributive lattice, then the chromatic number equals the clique number. If this number is finite, then in the case of a distributive lattice, it is determined by the number of minimal prime ideals in the lattice. An estimate for the number of edges in such a graph of a finite lattice is given.
How to cite:
ISO 690:
Nimbhokar, S., Wasadikar, M., Pawar, M. 2010. Coloring of lattices. In Mathematica Slovaca, vol. 60, no.4, pp. 419-434. 0139-9918. DOI: https://doi.org/10.2478/s12175-010-0022-x
APA:
Nimbhokar, S., Wasadikar, M., Pawar, M. (2010). Coloring of lattices. Mathematica Slovaca, 60(4), 419-434. 0139-9918. DOI: https://doi.org/10.2478/s12175-010-0022-x
About edition: