×

zbMATH — the first resource for mathematics

Some upper bounds for the incidentor \((k,l)\)-chromatic number. (Russian) Zbl 1046.05033
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.

MSC:
05C15 Coloring of graphs and hypergraphs
05C20 Directed graphs (digraphs), tournaments
PDF BibTeX XML Cite