[1] Berge С.: The theory of graphs and its applications. Methuen, London and Wiley, New York, 1962. Zbl 0097.38903

[2] Berge С.: Graphes et hypergraphes. Dunod, Paris, 1970. MR 0357173 | Zbl 0213.25702

[3] de Bruijn N. G., Erdös P.: A colour problem for infinite graphs and a problem in the theory of relations. Nederl. Akad. Wetensch. Proc. Ser. A 54 = Indag. Math. J3 (1951), 371 - 373. DOI 10.1016/S1385-7258(51)50053-7

[4] Fiamčík J., Jucovič E.: Colouring the edges of a multigraph. Arch. Math. 21 (1970), 446-448. DOI 10.1007/BF01220944 | MR 0289355

[5] Gallai T.: On factorisation of graphs. Acta math. Acad. Sc. Hung. 1 (1950), 133-153. DOI 10.1007/BF02022560 | MR 0039980 | Zbl 0040.25901

[6] Harary F.: Graph theory. Addison-Wesley, Reading, Massachusetts, 1969. MR 0256911 | Zbl 0196.27202

[7] König D.: Theorie der endlichen und unendlichen Graphen. Akad. Verlagsgesellschaft, Leipzig, 1936; reprinted Chelsea, New York, 1950. MR 0886676

[8] Ore О.: Theory of graphs. Amer. Math. Soc, Providence, R. I., 1962. MR 0150753 | Zbl 0105.35401

[9] Ore О.: The four-color problem. Academic Press, New York-London, 1967. MR 0216979 | Zbl 0149.21101

[10] Petersen J.: Die Theorie der regulären Graphs. Acta Math. 75 (1891), 193 - 220. MR 1554815

[11] Shannon С. E.: A theorem on coloring the lines of a network. J. Math. and Phys. 28 (1949), 148-151. DOI 10.1002/sapm1949281148 | MR 0030203 | Zbl 0032.43203

[12] Визит В. Г.,: Об оценке хроматического класса p-графа. Сб. ,,Дискретный анализ", Новосибирск 3 (1964), 25-30. Zbl 0318.10032

[13] Визит В. Г.: Хроматический класс мультиграфа. Кибернетика J965, No. 3, 29-39.

[14] Зыков А. А.: Теория конечных графов. Наука, Новосибирск, 1969. Zbl 1149.62317