|
|
Diskretnyi Analiz i Issledovanie Operatsii, 2009, Volume 16, Issue 5, Pages 41–51
(Mi da586)
|
|
|
|
This article is cited in 10 scientific papers (total in 10 papers)
Continued sets of boundary classes of graphs for colorability problems
D. S. Malyshev Nizhny Novgorod State University, N. Novgorod, Russia
Abstract:
We point out continued sets of boundary classes of graphs for the 3-vertex-colorability problem and for the 3-edge-colorability problem. These are the first examples of graph problems with sets of boundary classes of such cardinality. Bibl. 9.
Keywords:
boundary classes of graphs, 3-colorability problems, continued sets of boundary classes.
Received: 21.01.2009 Revised: 27.06.2009
Citation:
D. S. Malyshev, “Continued sets of boundary classes of graphs for colorability problems”, Diskretn. Anal. Issled. Oper., 16:5 (2009), 41–51
Linking options:
https://www.mathnet.ru/eng/da586 https://www.mathnet.ru/eng/da/v16/i5/p41
|
| Statistics & downloads: |
| Abstract page: | 764 | | Full-text PDF : | 173 | | References: | 96 | | First page: | 3 |
|