Incidentor coloring of weighted multigraphs

@article{Vizing2006IncidentorCO,
  title={Incidentor coloring of weighted multigraphs},
  author={Vadym G. Vizing and Artem V. Pyatkin},
  journal={Electronic Notes in Discrete Mathematics},
  year={2006},
  volume={27},
  pages={103-104}
}
Let G = (V, E) be a directed loopless multigraph. Denote by Δ its maximum degree and by d(v) and d−(v) the outand in-degrees of a vertex v ∈ V , respectively. Each arc e = uv ∈ E has integer nonnegative weight p(e). The pair (u, e) is called the initial incidentor of an arc e adjoining a vertex u; pair (v, e) is the final incidentor adjoining v. Two… CONTINUE READING