|
Diskretnyi Analiz i Issledovanie Operatsii, 2009, Volume 16, Issue 1, Pages 80–92
(Mi da563)
|
|
|
|
This article is cited in 16 scientific papers (total in 16 papers)
On two-colour perfect colourings of circular graphs
D. B. Khoroshilova Novosibirsk State University
Abstract:
We consider perfect colourings of a certain class of infinite graphs called circular graphs. It is shown that every such perfect colouring yields a perfect colouring of an $n$-dimensional infinite lattice which has the same parameters as the original colouring. A construction that produces two-colour perfect colourings of circular graphs is proposed and the parameters of perfect colourings given by the construction are enumerated. Bibl. 12.
Keywords:
perfect colouring, circular graph, equitable partition.
Received: 16.09.2008 Revised: 17.11.2008
Citation:
D. B. Khoroshilova, “On two-colour perfect colourings of circular graphs”, Diskretn. Anal. Issled. Oper., 16:1 (2009), 80–92
Linking options:
https://www.mathnet.ru/eng/da563 https://www.mathnet.ru/eng/da/v16/i1/p80
|
Statistics & downloads: |
Abstract page: | 601 | Full-text PDF : | 155 | References: | 69 | First page: | 11 |
|