Pyatkin, A. V. Some upper bounds for the incidentor \((k,l)\)-chromatic number. (Russian) Zbl 1046.05033 Diskretn. Anal. Issled. Oper., Ser. 1 10, No. 2, 66-78 (2003). The author investigates the minimal number of colours sufficient for the incidentor \((k,l)\)-colouring of a multigraph of degree \(\Delta\) with some constraints on \(k\) and \(l\). New upper bounds for this number are obtained. Reviewer: O. V. Borodin (Novosibirsk) Cited in 2 Documents MSC: 05C15 Coloring of graphs and hypergraphs 05C20 Directed graphs (digraphs), tournaments Keywords:regular colouring; directed multigraph × Cite Format Result Cite Review PDF