Geodesic
On $(1,l)$-coloring of incidentors of multigraphs
Diskretnyj analiz i issledovanie operacij, Tome 24 (2017) no. 4, pp. 34-46.

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

It is proved that if $l$ is at least $\Delta/2-1$ then $(1,l)$-chromatic number of an arbitrary multigraph of maximum degree $\Delta$ is at most $\Delta+1$. Moreover, it is proved that the incidentors of every directed prism can be colored in four colors so that every two adjacent incidentors are colored distinctly and the difference between the colors of the final and initial incidentors of each arc is $1$. Illustr. 1, bibliogr. 10.
Keywords: incidentor coloring, $(1,l)$-coloring
Mots-clés : prism. 
@article{DA_2017_24_4_a2,
     author = {M. O. Golovachev and A. V. Pyatkin},
     title = {On $(1,l)$-coloring of incidentors of multigraphs},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {34--46},
     publisher = {mathdoc},
     volume = {24},
     number = {4},
     year = {2017},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2017_24_4_a2/}
}
TY  - JOUR
AU  - M. O. Golovachev
AU  - A. V. Pyatkin
TI  - On $(1,l)$-coloring of incidentors of multigraphs
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2017
SP  - 34
EP  - 46
VL  - 24
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2017_24_4_a2/
LA  - ru
ID  - DA_2017_24_4_a2
ER  - 
%0 Journal Article
%A M. O. Golovachev
%A A. V. Pyatkin
%T On $(1,l)$-coloring of incidentors of multigraphs
%J Diskretnyj analiz i issledovanie operacij
%D 2017
%P 34-46
%V 24
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2017_24_4_a2/
%G ru
%F DA_2017_24_4_a2
M. O. Golovachev; A. V. Pyatkin. On $(1,l)$-coloring of incidentors of multigraphs. Diskretnyj analiz i issledovanie operacij, Tome 24 (2017) no. 4, pp. 34-46. http://geodesic.mathdoc.fr/item/DA_2017_24_4_a2/

[1] V. G. Vizing, “A bipartite interpretation of a directed multigraph in problems of the coloring of incidentors”, Diskretn. Anal. Issled. Oper. Ser. 1, 9:1 (2002), 27–41 (Russian) | MR

[2] V. G. Vizing, “On linear factors of multigraphs”, Diskretn. Anal. Issled. Oper. Ser. 1, 10:4 (2003), 3–7 (Russian) | MR | Zbl

[3] V. G. Vizing, L. S. Mel'nikov, A. V. Pyatkin, “On the $(k,l)$-coloring of incidentors”, Diskretn. Anal. Issled. Oper. Ser. 1, 7:4 (2000), 29–37 (Russian) | MR | Zbl

[4] A. V. Pyatkin, “Some optimization problems of scheduling the transmission of messages in a local communication network”, Operations Research and Discrete Analysis, Math. Appl., 391, ed. A. D. Korshunov, Kluwer Acad. Publ., Dordrecht, 1997, 227–232 | MR | MR | Zbl

[5] A. V. Pyatkin, “Upper and lower bounds for the incidentor $(k,l)$-chromatic number”, Diskretn. Anal. Issled. Oper. Ser. 1, 11:1 (2004), 93–102 (Russian) | MR | Zbl

[6] A. V. Pyatkin, “On $(1,1)$-coloring of incidentors of multigraphs of degree $4$”, Diskretn. Anal. Issled. Oper. Ser. 1, 11:3 (2004), 59–62 (Russian) | MR | Zbl

[7] Diestel R., Graph theory, Grad. Texts Math., 173, Springer-Verl., Heidelberg, 2016 | MR

[8] Mel'nikov L. S., Vizing V. G., “The edge-chromatic number of a directed/ mixed multigraph”, J. Graph Theory, 23:4 (1999), 267–273 | 3.0.CO;2-D class='badge bg-secondary rounded-pill ref-badge extid-badge'>DOI | MR

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

[10] West D. B., Introduction to graph theory, Prentice Hall, Upper Saddle River, 2001 | MR