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.
Similar content being viewed by others
References
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.
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).
A. A. Zykov, “Hypergraphs,” Uspekhi Mat. Nauk 29(6), 89–154 (1974) [Russian Math. Surveys 29 (6), 89–156 (1974)].
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.
A. V. Pyatkin, Incidentor Coloring Problems and Their Applcations, Candidate’s Dissertation in Mathematics and Physics (Sobolev Inst. Math., Novosibirk, 1999).
Author information
Authors and Affiliations
Corresponding author
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
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
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S1990478909010165