Zobrazeno 1 - 2
of 2
pro vyhledávání: '"l−1-chromatic mean"'
Autor:
Anjali G., Sudev N. K.
Publikováno v:
Acta Universitatis Sapientiae: Informatica, Vol 11, Iss 2, Pp 184-205 (2019)
Graph coloring can be considered as a random experiment with the color of a randomly selected vertex as the random variable. In this paper, we consider the L(2, 1)-coloring of G as the random experiment and we discuss the concept of two fundamental s
Externí odkaz:
https://doaj.org/article/0953435059c9482b9c17ce16dbcfc519
Autor:
G. Anjali, Sudev Naduvath
Publikováno v:
Acta Universitatis Sapientiae: Informatica, Vol 11, Iss 2, Pp 184-205 (2019)
Graph coloring can be considered as a random experiment with the color of a randomly selected vertex as the random variable. In this paper, we consider the L(2, 1)-coloring of G as the random experiment and we discuss the concept of two fundamental s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8f32decb4dcbf995182bc84f6044be89
https://doi.org/10.2478/ausi-2019-0013
https://doi.org/10.2478/ausi-2019-0013