Про хроматичне число натуральних модульних графів
The problem of chromatic number definition for a subclass of numerical graphs, namely natural modular graphs, is raised for the first time. A few affirmations are proved which allow defining the chromatic number of these graphs with the number of generatrixes not over three. To solve a general probl...
Збережено в:
| Дата: | 2019 |
|---|---|
| Автори: | , |
| Формат: | Стаття |
| Мова: | rus |
| Опубліковано: |
The National Technical University of Ukraine "Igor Sikorsky Kyiv Polytechnic Institute"
2019
|
| Онлайн доступ: | http://journal.iasa.kpi.ua/article/view/165508 |
| Теги: |
Додати тег
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|
| Назва журналу: | System research and information technologies |
Репозитарії
System research and information technologies| Резюме: | The problem of chromatic number definition for a subclass of numerical graphs, namely natural modular graphs, is raised for the first time. A few affirmations are proved which allow defining the chromatic number of these graphs with the number of generatrixes not over three. To solve a general problem, a method of differences is proposed, possibilities of which are described and an example of its use is given. |
|---|