|
This article is cited in 4 scientific papers (total in 4 papers)
On the number of boundary classes in the 3-colouring problem
D. S. Malyshev
Abstract:
The notion of a boundary class is a useful notion in the investigation of the complexity of extremal problems on graphs. One boundary class is known for the independent set problem and three boundary classes are known for the dominating set problem. In this paper it is proved that the set of boundary classes for the 3-colouring problem is infinite.
Received: 08.01.2008
Citation:
D. S. Malyshev, “On the number of boundary classes in the 3-colouring problem”, Diskr. Mat., 21:4 (2009), 129–134; Discrete Math. Appl., 19:6 (2009), 625–630
Linking options:
https://www.mathnet.ru/eng/dm1077https://doi.org/10.4213/dm1077 https://www.mathnet.ru/eng/dm/v21/i4/p129
|
Statistics & downloads: |
Abstract page: | 467 | Full-text PDF : | 174 | References: | 33 | First page: | 14 |
|