Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Gayathri Narayana Yegnanarayanan"'
Publikováno v:
Symmetry, Vol 10, Iss 10, p 468 (2018)
A vertex coloring of a graph G is a mapping that allots colors to the vertices of G. Such a coloring is said to be a proper vertex coloring if two vertices joined by an edge receive different colors. The chromatic number χ ( G ) is the least number
Externí odkaz:
https://doaj.org/article/76fe04228d884418ae31b7a3570fca1c
Autor:
Jane Rubel Angelina Jeyaraj, Subhashini Sottallu Janakiram, Gayathri Narayana Yegnanarayanan, Yegnanarayanan Venkataraman
Publikováno v:
Human-Assisted Intelligent Computing ISBN: 9780750348010
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::683d54f260d0657e66d80e5e5c01411e
https://doi.org/10.1088/978-0-7503-4801-0ch8
https://doi.org/10.1088/978-0-7503-4801-0ch8
Publikováno v:
Symmetry
Volume 10
Issue 10
Symmetry, Vol 10, Iss 10, p 468 (2018)
Volume 10
Issue 10
Symmetry, Vol 10, Iss 10, p 468 (2018)
A vertex coloring of a graph G is a mapping that allots colors to the vertices of G. Such a coloring is said to be a proper vertex coloring if two vertices joined by an edge receive different colors. The chromatic number χ ( G ) is the least number
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d4897bfa5b929455d692b73d832e35e2