On chromatic number of natural modular graphs

Authors

  • G. P. Donets
  • G. O. Shulinok

Abstract

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.

Author Biographies

G. P. Donets

Donets G.P.

G. O. Shulinok

Shulinok G.O.

Downloads

Issue

No. 1 (2006)

Section

New methods in system analysis, computer science and theory of decision making

License

This is an open access journal which means that all content is freely available without charge to the user or his/her institution. Users are allowed to read, download, copy, distribute, print, search, or link to the full texts of the articles in this journal without asking prior permission from the publisher or the author. This is in accordance with the BOAI definition of open access.