Two-Step Colouring of Grid Graphs of Different Types
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 2 between each other. The optimum two-step colour...
| मुख्य लेखक: | |
|---|---|
| स्वरूप: | लेख |
| भाषा: | English |
| प्रकाशित: |
Yaroslavl State University
2022-09-01
|
| श्रृंखला: | Моделирование и анализ информационных систем |
| विषय: | |
| ऑनलाइन पहुंच: | https://www.mais-journal.ru/jour/article/view/1710 |