Continued sets of boundary classes of graphs for colorability problems
Diskretnyj analiz i issledovanie operacij, Tome 16 (2009) no. 5, pp. 41-51

Voir la notice de l'article provenant de la source Math-Net.Ru

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.
@article{DA_2009_16_5_a4,
     author = {D. S. Malyshev},
     title = {Continued sets of boundary classes of graphs for colorability problems},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {41--51},
     publisher = {mathdoc},
     volume = {16},
     number = {5},
     year = {2009},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2009_16_5_a4/}
}
TY  - JOUR
AU  - D. S. Malyshev
TI  - Continued sets of boundary classes of graphs for colorability problems
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2009
SP  - 41
EP  - 51
VL  - 16
IS  - 5
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2009_16_5_a4/
LA  - ru
ID  - DA_2009_16_5_a4
ER  - 
%0 Journal Article
%A D. S. Malyshev
%T Continued sets of boundary classes of graphs for colorability problems
%J Diskretnyj analiz i issledovanie operacij
%D 2009
%P 41-51
%V 16
%N 5
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2009_16_5_a4/
%G ru
%F DA_2009_16_5_a4
D. S. Malyshev. Continued sets of boundary classes of graphs for colorability problems. Diskretnyj analiz i issledovanie operacij, Tome 16 (2009) no. 5, pp. 41-51. http://geodesic.mathdoc.fr/item/DA_2009_16_5_a4/