Skip to main content
SpringerLink
Log in

Bounds for the incidentor chromatic number of a weighted undirected multigraph

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

Abstract

A proper incidentor coloring of an undirected weighted multigraph is called admissible if the absolute value of the difference between the colors of the incidentors of each edge is at least the weight of this edge. The minimum number of colors necessary for an admissible incidentor coloring is called the incidentor chromatic number of the multigraph. The problem of finding this number is studied in the paper. The NP-hardness of this problem is proved for Δ colors. Some upper and lower bounds are found for the incidentor chromatic number.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. V.G. Vizing, “Bipartite Interpretation of Directed Multigraph in Incidentor Coloring Problems,” Diskret. Anal. Issled. Oper., Ser. 1, 9(1), 27–41 (2002).

    MathSciNet  Google Scholar 

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

    Google Scholar 

  3. V. G. Vizing and A. V. Pyatkin, “On an Incidentor Coloring in a Directed Weighted Multigraph,” Diskret. Anal. Issled. Oper., Ser. 1, 13(1), 33–44 (2006).

    MathSciNet  Google Scholar 

  4. V. G. Vizing and B. Toft, “Coloring of Incidentors and Vertices of Undirected Multigraph,” Diskret. Anal. Issled. Oper., Ser. 1, 8(3), 3–14 (2001).

    MATH  MathSciNet  Google Scholar 

  5. M. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (W. H. Freeman and Company, New York, 1979).

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. ul. Varnenskaya 18/2, ap. 26, Odessa, 65070, the Ukraine

    V. G. Vizing

  2. Sobolev Institute of Mathematics, pr. Akad. Koptyuga 4, Novosibirsk, 630090, Russia

    A. V. Pyatkin

Authors
  1. V. G. Vizing
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. V. Pyatkin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to V. G. Vizing.

Additional information

Original Russian Text © V.G. Vizing, A.V. Pyatkin, 2007, published in Diskretnyi Analiz i Issledovanie Operatsii, Ser. 1, 2007, Vol. 14, No. 2, pp. 3–15.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Vizing, V.G., Pyatkin, A.V. Bounds for the incidentor chromatic number of a weighted undirected multigraph. J. Appl. Ind. Math. 2, 432–439 (2008). https://doi.org/10.1134/S1990478908030149

Download citation

  • Received:

  • Published:

  • Issue Date:

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

Keywords

Search

Navigation