Skip to main content
Log in

On incidentor coloring in a hypergraph

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

Abstract

The problem is considered of the incidentor p-coloring of directed and undirected hypergraphs. The exact lower and upper bounds are given of the minimum necessary number of colors.

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 and A. V. Pyatkin, “Incidentor Coloring of Multigraphs Problem,” in Russian Conference “Discrete Analysis and Operations Research.” Book of Abstracts (Sobolev Inst. Mat., Novosibirsk, 2004), pp. 6–11.

    Google Scholar 

  2. V. G. Vizing and B. Toft, “Incidentor and Vertex Coloring of an Undirected Multigraph,” Diskret. Anal. Oper. Res., Ser. 1, 8(3), 3–14 (2001).

    MATH  MathSciNet  Google Scholar 

  3. A. A. Zykov, “Hypergraphs,” Uspekhi Mat. Nauk 29(6), 89–154 (1974) [Russian Math. Surveys 29 (6), 89–156 (1974)].

    MathSciNet  Google Scholar 

  4. A. V. Pyatkin, “Some Optimization Problems of Scheduling the Transmission of Messages in a Local Communication Network,” in Operations Research and Discrete Analysis, Ed. by A. D. Korshunov (Kluwer Academic, Netherlands, 1997), pp. 227–232.

    Google Scholar 

  5. A. V. Pyatkin, Incidentor Coloring Problems and Their Applcations, Candidate’s Dissertation in Mathematics and Physics (Sobolev Inst. Math., Novosibirk, 1999).

    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, 2007, published in Diskretnyi Analiz i Issledovanie Operatsii, Ser. 1, 2007, Vol. 14, No. 3, pp. 40–45.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Vizing, V.G. On incidentor coloring in a hypergraph. J. Appl. Ind. Math. 3, 144–147 (2009). https://doi.org/10.1134/S1990478909010165

Download citation

  • Received:

  • Published:

  • Issue Date:

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

Keywords

Navigation