On (1,l)-coloring of incidentors of multigraphs

Standard

On (1,l)-coloring of incidentors of multigraphs. / Golovachev, M. O.; Pyatkin, A. V.

In: Journal of Applied and Industrial Mathematics, Vol. 11, No. 4, 01.10.2017, p. 514-520.

Research output: Contribution to journal › Article › peer-review

Harvard

Golovachev, MO & Pyatkin, AV 2017, 'On (1,l)-coloring of incidentors of multigraphs', Journal of Applied and Industrial Mathematics, vol. 11, no. 4, pp. 514-520. https://doi.org/10.1134/S1990478917040081

APA

Golovachev, M. O., & Pyatkin, A. V. (2017). On (1,l)-coloring of incidentors of multigraphs. Journal of Applied and Industrial Mathematics, 11(4), 514-520. https://doi.org/10.1134/S1990478917040081

Vancouver

Golovachev MO, Pyatkin AV. On (1,l)-coloring of incidentors of multigraphs. Journal of Applied and Industrial Mathematics. 2017 Oct 1;11(4):514-520. doi: 10.1134/S1990478917040081

Author

Golovachev, M. O. ; Pyatkin, A. V. / On (1,l)-coloring of incidentors of multigraphs. In: Journal of Applied and Industrial Mathematics. 2017 ; Vol. 11, No. 4. pp. 514-520.

BibTeX

@article{d0672e365dcd4710a69fced4e6d4de92,

title = "On (1,l)-coloring of incidentors of multigraphs",

abstract = "It is proved that if l is at least Δ/2 − 1 then (1, l)-chromatic number of an arbitrary multigraph of maximum degree Δ is at most Δ+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.",

keywords = "(1, l)-coloring, incidentor coloring, prism",

author = "Golovachev, {M. O.} and Pyatkin, {A. V.}",

note = "Publisher Copyright: {\textcopyright} 2017, Pleiades Publishing, Ltd.",

year = "2017",

month = oct,

day = "1",

doi = "10.1134/S1990478917040081",

language = "English",

volume = "11",

pages = "514--520",

journal = "Journal of Applied and Industrial Mathematics",

issn = "1990-4789",

publisher = "Maik Nauka-Interperiodica Publishing",

number = "4",

}

RIS

TY - JOUR

T1 - On (1,l)-coloring of incidentors of multigraphs

AU - Golovachev, M. O.

AU - Pyatkin, A. V.

PY - 2017/10/1

Y1 - 2017/10/1

N2 - It is proved that if l is at least Δ/2 − 1 then (1, l)-chromatic number of an arbitrary multigraph of maximum degree Δ is at most Δ+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.

AB - It is proved that if l is at least Δ/2 − 1 then (1, l)-chromatic number of an arbitrary multigraph of maximum degree Δ is at most Δ+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.

KW - (1, l)-coloring

KW - incidentor coloring

KW - prism

UR - http://www.scopus.com/inward/record.url?scp=85036472429&partnerID=8YFLogxK

U2 - 10.1134/S1990478917040081

DO - 10.1134/S1990478917040081

M3 - Article

AN - SCOPUS:85036472429

VL - 11

SP - 514

EP - 520

JO - Journal of Applied and Industrial Mathematics

JF - Journal of Applied and Industrial Mathematics

SN - 1990-4789

IS - 4

ER -

ID: 9033110