Voir la notice de l'article provenant de la source Czech Digital Mathematics Library
MR ZblŽerovnik, Janez. On recognition of strong graph bundles. Mathematica slovaca, Tome 50 (2000) no. 3, pp. 289-301. http://geodesic.mathdoc.fr/item/MASLO_2000_50_3_a3/
@article{MASLO_2000_50_3_a3,
author = {\v{Z}erovnik, Janez},
title = {On recognition of strong graph bundles},
journal = {Mathematica slovaca},
pages = {289--301},
year = {2000},
volume = {50},
number = {3},
mrnumber = {1775302},
zbl = {0984.05068},
language = {en},
url = {http://geodesic.mathdoc.fr/item/MASLO_2000_50_3_a3/}
}
[1] ABELLO J.-FELLOWS M. R.-STILLWELL J. C.: On the complexity and combinatorics of covering finite complexes. Australas. J. Combin. 4 (1991), 103-112. | MR | Zbl
[2] HUSEMOLLER D.: Fibre Bundles. (Зrd ed.), Springer, Berlin, 1993. | MR | Zbl
[3] DÖRFLER W.-IMRICH W.: Über das starke Produkt von endlichen Graphen. Österreich. Akad. Wiss. Math.-Natur. Kl. Sitzungsber. II 178 (1969), 247-262. | MR
[4] FEDER T.: Product graph representations. J. Graph Theory 16 (1992), 467-488. | MR | Zbl
[5] FEIGENBAUM J.-SCHÄFFER A. A.: Recognizing composite graphs is equivalent to testing graph isomorphism. SIAM J. Comput. 15 (1986), 619-627. | MR | Zbl
[6] FEIGENBAUM J.-HERSHBERGER J.-SCHÄFFER A. A.: A polynomial time algorithm for finding the prime factors of Cartesian-product graphs. Discrete Appl. Math. 12 (1985), 123-138. | MR | Zbl
[7] FEIGENBAUM J.-SCHÄFFER A. A.: Finding the prime factors of strong direct product graphs in polynomial time. Discrete Math. 109 (1992), 77-102. | MR | Zbl
[8] IMRICH W.: Embedding graphs into Cartesian products. In: Graph Theory and Applications: East and west. Proceedings of the first China-USA international conference, held in Jinan, China, June 9-20, 1986 (M. F. Capobianco et al. eds.), Ann. New York Acad. Sci. 576 (1989), 266-274. | MR
[9] IMRICH W.-ŽEROVNIK J.: Factoring Cartesian-product graphs. J. Graph Theory 18 (1994), 557-567. | MR | Zbl
[10] IMRICH W.-PISANSKI T.-ŽEROVNIK J.: Recognizing Cartesian graph bundles. Discrete Math. 167/168 (1997), 393-403. | MR | Zbl
[11] IMRICH W.-IZBICKI H.: Associative products of graphs. Monatsh. Math. 80 (1975), 277-281. | MR | Zbl
[12] KLAVŽAR S.-MOHAR B.: Coloring graph bundles. J. Graph Theory 19 (1995), 145-155. | MR | Zbl
[13] KLAVŽAR S.-MOHAR B.: The chromatic numbers of graph bundles over cycles. Discrete Math. 138 (1995), 301-314. | MR | Zbl
[14] KWAK J. H.-LEE J.: Isomorphism classes of graph bundles. Canad. J. Math. 42 (1990), 747-761. | MR | Zbl
[15] KWAK J. H.-LEE J.: Characteristic polynomials of some graph Bundles II. Linear and Multilinear Algebra 32 (1992), 61-73. | MR | Zbl
[16] MCKENZIE R.: Cardinal multiplication of structures with a reflexive relation. Fund. Math. LXX (1971), 59-101. | MR | Zbl
[17] MOHAR B.-PISANSKI T.-ŠKOVIERA M.: The maximum genus of graph bundles. European J. Combin. 9 (1988), 301-314. | MR | Zbl
[18] PISANSKI T.-SHAWE-TAYLOR J.-VRABEC J.: Edge-colorability of graph bundles. J. Combin. Theory Ser. B 35 (1983), 12-19. | MR | Zbl
[19] PISANSKI T.-VRABEC J.: Graph bundles. Unpublished manuscript 1982.
[20] SABIDUSSI G.: Graph multiplication. Math. Z. 72 (1960), 446-457. | MR | Zbl
[21] SOHN M. Y.-LEE J.: Characteristic polynomials of some weighted graph bundles and its application to links. Internat. J. Math. Math. Sci. 17 (1994), 504-510. | MR | Zbl
[22] WINKLER P. M.: Factoring a graph in polynomial time. European J. Combin. 8 (1987), 209-212. | MR | Zbl
[23] ZMAZEK B.-ŽEROVNIK J.: Recognizing weighted directed Cartesian graph bundles. Discuss. Math. (To appear). | MR | Zbl