Previous |  Up |  Next

Article

Title: On recognition of strong graph bundles (English)
Author: Žerovnik, Janez
Language: English
Journal: Mathematica Slovaca
ISSN: 0139-9918
Volume: 50
Issue: 3
Year: 2000
Pages: 289-301
.
Category: math
.
MSC: 05C62
MSC: 05C70
MSC: 05C85
idZBL: Zbl 0984.05068
idMR: MR1775302
.
Date available: 2009-09-25T11:44:57Z
Last updated: 2012-08-01
Stable URL: http://hdl.handle.net/10338.dmlcz/136778
.
Reference: [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. Zbl 0763.05035, MR 1129272
Reference: [2] HUSEMOLLER D.: Fibre Bundles.(Зrd ed.), Springer, Berlin, 1993. Zbl 0794.55001, MR 0370578
Reference: [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 0285454
Reference: [4] FEDER T.: Product graph representations.J. Graph Theory 16 (1992), 467-488. Zbl 0766.05092, MR 1185011
Reference: [5] FEIGENBAUM J.-SCHÄFFER A. A.: Recognizing composite graphs is equivalent to testing graph isomorphism.SIAM J. Comput. 15 (1986), 619-627. Zbl 0602.68033, MR 0837609
Reference: [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. Zbl 0579.68028, MR 0808453
Reference: [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. Zbl 0786.68076, MR 1192372
Reference: [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 1110824
Reference: [9] IMRICH W.-ŽEROVNIK J.: Factoring Cartesian-product graphs.J. Graph Theory 18 (1994), 557-567. Zbl 0811.05054, MR 1292975
Reference: [10] IMRICH W.-PISANSKI T.-ŽEROVNIK J.: Recognizing Cartesian graph bundles.Discrete Math. 167/168 (1997), 393-403. Zbl 0876.05094, MR 1446759
Reference: [11] IMRICH W.-IZBICKI H.: Associative products of graphs.Monatsh. Math. 80 (1975), 277-281. Zbl 0328.05136, MR 0404058
Reference: [12] KLAVŽAR S.-MOHAR B.: Coloring graph bundles.J. Graph Theory 19 (1995), 145-155. Zbl 0815.05029, MR 1315434
Reference: [13] KLAVŽAR S.-MOHAR B.: The chromatic numbers of graph bundles over cycles.Discrete Math. 138 (1995), 301-314. Zbl 0818.05035, MR 1322105
Reference: [14] KWAK J. H.-LEE J.: Isomorphism classes of graph bundles.Canad. J. Math. 42 (1990), 747-761. Zbl 0739.05042, MR 1074233
Reference: [15] KWAK J. H.-LEE J.: Characteristic polynomials of some graph Bundles II.Linear and Multilinear Algebra 32 (1992), 61-73. Zbl 0755.05078, MR 1198821
Reference: [16] MCKENZIE R.: Cardinal multiplication of structures with a reflexive relation.Fund. Math. LXX (1971), 59-101. Zbl 0228.08002, MR 0280430
Reference: [17] MOHAR B.-PISANSKI T.-ŠKOVIERA M.: The maximum genus of graph bundles.European J. Combin. 9 (1988), 301-314. Zbl 0642.05019, MR 0947023
Reference: [18] PISANSKI T.-SHAWE-TAYLOR J.-VRABEC J.: Edge-colorability of graph bundles.J. Combin. Theory Ser. B 35 (1983), 12-19. Zbl 0505.05034, MR 0723566
Reference: [19] PISANSKI T.-VRABEC J.: Graph bundles.Unpublished manuscript 1982.
Reference: [20] SABIDUSSI G.: Graph multiplication.Math. Z. 72 (1960), 446-457. Zbl 0093.37603, MR 0209177
Reference: [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. Zbl 0808.05073, MR 1277736
Reference: [22] WINKLER P. M.: Factoring a graph in polynomial time.European J. Combin. 8 (1987), 209-212. Zbl 0625.05050, MR 0896134
Reference: [23] ZMAZEK B.-ŽEROVNIK J.: Recognizing weighted directed Cartesian graph bundles.Discuss. Math. (To appear). Zbl 0966.05049, MR 1781495
.

Files

Files Size Format View
MathSlov_50-2000-3_4.pdf 960.6Kb application/pdf View/Open
Back to standard record
Partner of
EuDML logo