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

M. O. Golovachev, A. V. Pyatkin

Research output: Contribution to journalArticlepeer-review

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.

Original languageEnglish
Pages (from-to)514-520
Number of pages7
JournalJournal of Applied and Industrial Mathematics
Volume11
Issue number4
DOIs
Publication statusPublished - 1 Oct 2017

Keywords

  • (1, l)-coloring
  • incidentor coloring
  • prism

Fingerprint Dive into the research topics of 'On (1,l)-coloring of incidentors of multigraphs'. Together they form a unique fingerprint.

Cite this