×

zbMATH — the first resource for mathematics

Chromatic index of finite and infinite graphs. (English) Zbl 0239.05113

MSC:
05C15 Coloring of graphs and hypergraphs
PDF BibTeX XML Cite
Full Text: EuDML
References:
[1] Berge C.: The theory of graphs and its applications. Methuen, London and Wiley, New York, 1962. · Zbl 0097.38903
[2] Berge C.: Graphes et hypergraphes. Dunod, Paris, 1970. · 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. · Zbl 0044.38203
[4] Fiamčík J., Jucovič E.: Colouring the edges of a multigraph. Arch. Math. 21 (1970), 446-448. · Zbl 0203.26501
[5] Gallai T.: On factorisation of graphs. Acta math. Acad. Sc. Hung. 1 (1950), 133-153. · Zbl 0040.25901
[6] Harary F.: Graph theory. Addison-Wesley, Reading, Massachusetts, 1969. · Zbl 0196.27202
[7] König D.: Theorie der endlichen und unendlichen Graphen. Akad. Verlagsgesellschaft, Leipzig, 1936; reprinted Chelsea, New York, 1950. · JFM 62.0654.05
[8] Ore O.: Theory of graphs. Amer. Math. Soc, Providence, R. I., 1962. · Zbl 0105.35401
[9] Ore O.: The four-color problem. Academic Press, New York-London, 1967. · Zbl 0149.21101
[10] Petersen J.: Die Theorie der regulären Graphs. Acta Math. 75 (1891), 193 - 220. · JFM 23.0115.03
[11] Shannon C. E.: A theorem on coloring the lines of a network. J. Math. and Phys. 28 (1949), 148-151. · Zbl 0032.43203
[12] Визит В. Г.,: Об оценке хроматического класса р-графа. C6. ,,Дискретный анализ”, Новосибирск 3 (1964), 25-30. · Zbl 0318.10032
[13] Визит В. Г.: Хроматический класс мультиграфа. Кибернетика Ј965, No. 3, 29-39.
[14] Зыков А. А.: Теория конечных графов. Hauka, Новосибирск, 1969. · Zbl 1149.62317
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. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.