×

Coloring graph bundles. (English) Zbl 0815.05029

Authors’ abstract: Graph bundles generalize the notions of covering graphs and products of graphs. Several results about the chromatic numbers of graph bundles based on the Cartesian product, the strong product and the tensor product are presented.
Reviewer: S.Stahl (Lawrence)

MSC:

05C15 Coloring of graphs and hypergraphs
05C99 Graph theory
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Discrete Mathematics. Clarendon Press, Oxford (1989).
[2] Duffus, J. Graph Theory 9 pp 487– (1985)
[3] El-Zahar, Combinatorica 5 pp 121– (1985)
[4] Geller, Discrete Math. 16 pp 9– (1976)
[5] Geller, J. Combinat. Theory Ser. B 19 pp 87– (1975)
[6] Häggkvist, Combinatorica 8 pp 63– (1988)
[7] Technical Report 03105-44-T, University of Michigan (1966).
[8] Fibre Bundles. McGraw-Hill, New York (1966). · doi:10.1007/978-1-4757-4008-0
[9] Klavžar, Discrete Math. 109 pp 155– (1992)
[10] Klavžar, Aequationes Math. 45 pp 153– (1993)
[11] Klavžar, Discrete Math.
[12] Kwak, Can. J. Math. 42 pp 747– (1990) · Zbl 0739.05042 · doi:10.4153/CJM-1990-039-3
[13] Mohar, Eur. J. Combinat. 9 pp 215– (1988) · Zbl 0642.05019 · doi:10.1016/S0195-6698(88)80012-X
[14] Pisanski, J. Combinat. Theory Ser. B 35 pp 12– (1983)
[15] and , unpublished manuscript (1982).
[16] Sabidussi, Can. J. Math. 9 pp 515– (1957) · Zbl 0079.39202 · doi:10.4153/CJM-1957-060-7
[17] Sauer, J. Graph Theory 16 pp 423– (1992)
[18] Stahl, J. Combinat. Theory Ser. B 20 pp 185– (1976)
[19] Vesztergombi, Acta Cybernet. 4 pp 207– (1978/79)
[20] Chromatic number of strong product of graphs. Algebraic Methods in Graph Theory (eds. ) Colloq. Math. Soc. J. Bolyai 25, North-Holland, Amsterdam (1982) 819–825.
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.