Geodesic
Strict coloring of incidentors in undirected multigraphs
Diskretnyj analiz i issledovanie operacij, Tome 12 (2005) no. 3, pp. 48-53.

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

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

[1] Vizing V. G., “Ob otsenke khromaticheskogo klassa $p$-grafa”, Diskretnyi analiz, Sb. nauch. tr., no. 3, In-t matematiki SO AN SSSR, Novosibirsk, 1964, 25–30 | MR

[2] Vizing V. G., “Khromaticheskii klass multigrafa”, Kibernetika, 1965, no. 3, 29–39 | MR | Zbl

[3] Vizing V. G., Pyatkin A. V., “Zadacha raskraski intsidentorov multigrafa”, Rossiiskaya konferentsiya “Diskretnyi analiz i issledovanie operatsii”, Materialy konferentsii (Novosibirsk, 28 iyunya–2 iyulya 2004), Izd-vo In-ta matematiki, Novosibirsk, 2004

[4] 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

[5] Zykov A. A., Osnovy teorii grafov, Vuzovskaya kniga, M., 2004

[6] Pyatkin A. V., “Nekotorye zadachi optimizatsii raspisaniya peredachi soobschenii v lokalnoi seti svyazi”, Diskret. analiz i issled. operatsii, 2:4 (1995), 74–70 | MR

[7] Hanson D., Loten C. O. M., Toft B., “On interval colourings of bi-regular bipartite graphs”, Ars Combinat, 50 (1998), 23–32 | MR | Zbl

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

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

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