On recognition of strong graph bundles

Janez Žerovnik

Mathematica Slovaca (2000)

  • Volume: 50, Issue: 3, page 289-301
  • ISSN: 0232-0525

How to cite

top

Žerovnik, Janez. "On recognition of strong graph bundles." Mathematica Slovaca 50.3 (2000): 289-301. <http://eudml.org/doc/34515>.

@article{Žerovnik2000,
author = {Žerovnik, Janez},
journal = {Mathematica Slovaca},
keywords = {graph bundles; strong graph product; recognition algorithm},
language = {eng},
number = {3},
pages = {289-301},
publisher = {Mathematical Institute of the Slovak Academy of Sciences},
title = {On recognition of strong graph bundles},
url = {http://eudml.org/doc/34515},
volume = {50},
year = {2000},
}

TY - JOUR
AU - Žerovnik, Janez
TI - On recognition of strong graph bundles
JO - Mathematica Slovaca
PY - 2000
PB - Mathematical Institute of the Slovak Academy of Sciences
VL - 50
IS - 3
SP - 289
EP - 301
LA - eng
KW - graph bundles; strong graph product; recognition algorithm
UR - http://eudml.org/doc/34515
ER -

References

top
  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. (1991) Zbl0763.05035MR1129272
  2. HUSEMOLLER D., Fibre Bundles, (Зrd ed.), Springer, Berlin, 1993. (1993) Zbl0794.55001MR0370578
  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. (1969) MR0285454
  4. FEDER T., Product graph representations, J. Graph Theory 16 (1992), 467-488. (1992) Zbl0766.05092MR1185011
  5. FEIGENBAUM J.-SCHÄFFER A. A., Recognizing composite graphs is equivalent to testing graph isomorphism, SIAM J. Comput. 15 (1986), 619-627. (1986) Zbl0602.68033MR0837609
  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. (1985) Zbl0579.68028MR0808453
  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. (1992) Zbl0786.68076MR1192372
  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. (1986) MR1110824
  9. IMRICH W.-ŽEROVNIK J., Factoring Cartesian-product graphs, J. Graph Theory 18 (1994), 557-567. (1994) Zbl0811.05054MR1292975
  10. IMRICH W.-PISANSKI T.-ŽEROVNIK J., Recognizing Cartesian graph bundles, Discrete Math. 167/168 (1997), 393-403. (1997) Zbl0876.05094MR1446759
  11. IMRICH W.-IZBICKI H., Associative products of graphs, Monatsh. Math. 80 (1975), 277-281. (1975) Zbl0328.05136MR0404058
  12. KLAVŽAR S.-MOHAR B., Coloring graph bundles, J. Graph Theory 19 (1995), 145-155. (1995) Zbl0815.05029MR1315434
  13. KLAVŽAR S.-MOHAR B., The chromatic numbers of graph bundles over cycles, Discrete Math. 138 (1995), 301-314. (1995) Zbl0818.05035MR1322105
  14. KWAK J. H.-LEE J., Isomorphism classes of graph bundles, Canad. J. Math. 42 (1990), 747-761. (1990) Zbl0739.05042MR1074233
  15. KWAK J. H.-LEE J., Characteristic polynomials of some graph Bundles II, Linear and Multilinear Algebra 32 (1992), 61-73. (1992) Zbl0755.05078MR1198821
  16. MCKENZIE R., Cardinal multiplication of structures with a reflexive relation, Fund. Math. LXX (1971), 59-101. (1971) Zbl0228.08002MR0280430
  17. MOHAR B.-PISANSKI T.-ŠKOVIERA M., The maximum genus of graph bundles, European J. Combin. 9 (1988), 301-314. (1988) Zbl0642.05019MR0947023
  18. PISANSKI T.-SHAWE-TAYLOR J.-VRABEC J., Edge-colorability of graph bundles, J. Combin. Theory Ser. B 35 (1983), 12-19. (1983) Zbl0505.05034MR0723566
  19. PISANSKI T.-VRABEC J., Graph bundles, Unpublished manuscript 1982. (1982) 
  20. SABIDUSSI G., Graph multiplication, Math. Z. 72 (1960), 446-457. (1960) Zbl0093.37603MR0209177
  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. (1994) Zbl0808.05073MR1277736
  22. WINKLER P. M., Factoring a graph in polynomial time, European J. Combin. 8 (1987), 209-212. (1987) Zbl0625.05050MR0896134
  23. ZMAZEK B.-ŽEROVNIK J., Recognizing weighted directed Cartesian graph bundles, Discuss. Math. (To appear). Zbl0966.05049MR1781495

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.