×

Colouring the edges of a multigraph. (English) Zbl 0203.26501


PDFBibTeX XMLCite
Full Text: DOI

References:

[1] G.Ringel, Färbungsprobleme auf Flächen und Graphen. Berlin 1959.
[2] C. E. Shannon, A theorem on coloring the lines of a network. J. Math. and Phys.28, 148–151 (1949). · Zbl 0032.43203
[3] V. G. Vizing, Ob ocenke chromatifieskogo klassa p-grafa (An estimate of the chromatic class of ap-graph). Diskret. Analiz.3, 25–30 (1964).
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.