Algorithm for recognizing Cartesian graph bundles

Discrete Applied Mathematics

Volumn 120, Issue 1-3, 2002, Pages 275-302

  Zmazek, Blaž ^a   Žerovnik, Janez ^a  

^a UNIVERSITY OF MARIBOR   (Slovenia)

Author keywords

Cartesian graph bundles; Fundamental factorization; Polynomial algorithm; Recognition; Unique square property

Indexed keywords

EID: 84867975559     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(01)00296-7     Document Type: Article

References (22)

1. J. Abello, M.R. Fellows, and J.C. Stillwell On the complexity and combinatorics of covering finite complexes Australasian J. Combin. 4 1991 103 112
2. F. Aurenhammer, J. Hagauer, and W. Imrich Cartesian graph factorization at logarithmic cost per edge Comput. Complexity 2 1992 331 349
3. T. Feder Product graph representations J. Graph Theory 16 1992 467 488
4. J. Feigenbaum, J. Hershberger, and A.A. Schäffer A polynomial time algorithm for finding the prime factors of Cartesian-product graphs Discrete Appl. Math. 12 1985 123 138 (Pubitemid 15583519)
5. D. Husemoller Fibre Bundles 3rd Edition 1993 Springer Berlin
6. W. Imrich, and H. Izbicki Associative products of graphs Monat. für Math. 80 1975 277 281
7. W. Imrich, and S. KlavŽar Product Graphs, Structure and Recognition 2000 Wiley New York
8. W. Imrich, T. Pisanski, and J. Žerovnik Recognizing Cartesian graph bundles Discrete Math. 167, 168 1998 393 403 (Pubitemid 127367573)
9. W. Imrich, and J. Žerovnik Factoring Cartesian-product graphs J. Graph Theory 18 1994 557 567
10. S. KlavŽar, and B. Mohar Coloring graph bundles J. Graph Theory 19 1995 145 155
11. S. KlavŽar, and B. Mohar The chromatic numbers of graph bundles over cycles Discrete Math. 138 1995 301 314
12. J.H. Kwak, and J. Lee Isomorphism classes of graph bundles Canad. J. Math. 42 1990 747 761
13. J.H. Kwak, and J. Lee Characteristic polynomials of some graph bundles II Linear Multilinear Algebra 32 1992 61 73
14. B. Mohar, T. Pisanski, and M. Škoviera The maximum genus of graph bundles European J. Combin. 9 1988 301 314
15. T. Pisanski, J. Shawe-Taylor, and J. Vrabec Edge-colorability of graph bundles J. Combin. Theory Ser. B35 1983 12 19
16. T. Pisanski, J. Vrabec, Graph bundles, 1982, unpublished manuscript.
17. G. Sabidussi Graph multiplication Math. Z. 72 1960 446 457
18. M.Y. Sohn, and J. Lee Characteristic polynomials of some weighted graph bundles and its application to links Internat. J. Math. Math. Sci. 17 1994 504 510
19. P.M. Winkler Factoring a graph in polynomial time European J. Combin. 8 1987 209 212
20. B. Zmazek, and J. Žerovnik On recognizing Cartesian graph bundles Discrete Math. 233 2001 381 391 (Pubitemid 33660420)
21. B. Zmazek, J. Žerovnik, Unique square property and fundamental factorization, Discrete Math., 244 (2002) 103.
22. J. Žerovnik Recognizing graph product and bundles K.G. Jefferey, J. Král, M. Bartošek, SOFSEM'96: Theory and Practise of Informatics Lecture Notes in Computer Science Vol. 1175 1996 Springer Berlin 467 474