Zobrazeno 1 - 1
of 1
pro vyhledávání: '"octogonal grid graph"'
Publikováno v:
Моделирование и анализ информационных систем, Vol 29, Iss 3, Pp 166-180 (2022)
In this article, we consider the NP-hard problem of the two-step colouring of a graph. It is required to colour the graph in a given number of colours in a way, when no pair of vertices has the same colour, if these vertices are at a distance of 1 or
Externí odkaz:
https://doaj.org/article/66b2c623712945f78cba1c933dca1aa8
