Skip to main content
Log in

Multicoloring the incidentors of a weighted directed multigraph

  • Published:
Journal of Applied and Industrial Mathematics Aims and scope Submit manuscript

Abstract

Under study are the directed multigraphs with weighted arcs. In multicoloring incidentors, each incidentor is endowed with a multicolor, i.e., an interval of colors whose length is equal to the weight of the incidentor. A multicoloring is admissible if the multicolors of adjacent incidentors are disjoint and, for every arc, the left endpoint of its initial incidentor is at most the left endpoint of the multicolor of its final incidentor. The lower and upper bounds are presented for the minimal number of colors necessary for an admissible multicoloring of all incidentors of a multigraph.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. V. G. Vizing, “On Bounds for the Incidentor Chromatic Number of a Directed Weighted Multigraph,” Diskretn. Anal. Issled. Oper. Ser. 1, 13(4), 18–25 (2006) [J. Appl. Indust. Math. 1 (4), 504–508 (2007)].

    MATH  MathSciNet  Google Scholar 

  2. V. G. Vizing, “Multicoloring the Incidentors of a Weighted Undirected Multigraph,” Diskretn. Anal. Issled. Oper. 19(4), 35–47 (2012) [J. Appl. Indust. Math. 6 (4), 514–521 (2012)].

    MathSciNet  Google Scholar 

  3. V. G. Vizing and A. V. Pyatkin, “On the Coloring of Incidentors in an Oriented Weighted Multigraph,” Diskretn. Anal. Issled. Oper. Ser. 1, 13(1), 33–44 (2006).

    MATH  MathSciNet  Google Scholar 

  4. V. A. Zykov, Foundations of Graph Theory (Vuzovskaya Kniga, Moscow, 2004) [in Russian].

    Google Scholar 

  5. A. V. Pyatkin, “Some Optimization Problems of Scheduling the Transmission of Messages in a Local Communication Network,” Diskret. Anal. Issled. Oper. 2(4), 74–79 (1995) [in Operations Research and Discrete Analysis. Mathematics and Its Applications, Vol. 391 (1997), pp. 227–232].

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to V. G. Vizing.

Additional information

Original Russian Text © V.G. Vizing, 2014, published in Diskretnyi Analiz i Issledovanie Operatsii, 2014, Vol. 21, No. 4, pp. 33–41.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Vizing, V.G. Multicoloring the incidentors of a weighted directed multigraph. J. Appl. Ind. Math. 8, 604–608 (2014). https://doi.org/10.1134/S1990478914040188

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S1990478914040188

Keywords

Navigation