On the $(p,q)$-coloring of incidentors of an undirected multigraph
Diskretnyj analiz i issledovanie operacij, Tome 12 (2005) no. 4, pp. 23-39.

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

@article{DA_2005_12_4_a1,
     author = {V. G. Vizing},
     title = {On the $(p,q)$-coloring of incidentors of an undirected multigraph},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {23--39},
     publisher = {mathdoc},
     volume = {12},
     number = {4},
     year = {2005},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2005_12_4_a1/}
}
TY  - JOUR
AU  - V. G. Vizing
TI  - On the $(p,q)$-coloring of incidentors of an undirected multigraph
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2005
SP  - 23
EP  - 39
VL  - 12
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2005_12_4_a1/
LA  - ru
ID  - DA_2005_12_4_a1
ER  - 
%0 Journal Article
%A V. G. Vizing
%T On the $(p,q)$-coloring of incidentors of an undirected multigraph
%J Diskretnyj analiz i issledovanie operacij
%D 2005
%P 23-39
%V 12
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2005_12_4_a1/
%G ru
%F DA_2005_12_4_a1
V. G. Vizing. On the $(p,q)$-coloring of incidentors of an undirected multigraph. Diskretnyj analiz i issledovanie operacij, Tome 12 (2005) no. 4, pp. 23-39. http://geodesic.mathdoc.fr/item/DA_2005_12_4_a1/

[1] Vizing V. G., “Dvudolnaya interpretatsiya orientirovannogo multigrafa v zadachakh raskraski intsidentorov”, Diskret. analiz i issled. operatsii. Ser. 1, 9:1 (2002), 27–41 | MR

[2] Vizing V. G., “Faktornaya raskraska reber multigrafa”, Diskret. analiz i issled. operatsii. Ser. 1, 11:2 (2004), 18–31 | MR | Zbl

[3] Vizing V. G., “Zhestkaya raskraska intsidentorov neorientirovannogo multigrafa”, Diskret. analiz i issled. operatsii. Ser. 1, 12:3 (2005), 3–8 | MR

[4] Vizing V. G., Melnikov L. S., Pyatkin A. V., “O $(k,l)$-raskraske intsidentorov”, Diskret. analiz i issled. operatsii. Ser. 1, 7:4 (2000), 20–37 | MR

[5] Vizing V. G., Toft B., “Raskraska intsidentorov i vershin neorientirovannogo multigrafa”, Diskret. analiz i issled. operatsii. Ser. 1, 8:3 (2001), 3–14 | MR | Zbl

[6] Holyer I., “The NP-completeness of edge-coloring”, SIAM J. Comput., 10:4 (1981), 718–720 | DOI | MR | Zbl

[7] Petersen J., “Die Theorie der regularen Graphen”, Acta Math., 15 (1891), 193–220 | DOI | MR

[8] Shannon C., “A theorem on coloring the lines of a network”, J. Math. and Physics, 28 (1949), 148–151 | MR | Zbl