메뉴 건너뛰기




Volumn 167-168, Issue , 1997, Pages 393-403

Recognizing Cartesian graph bundles

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0039379618     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(96)00242-7     Document Type: Article
Times cited : (28)

References (16)
  • 1
    • 0011373247 scopus 로고
    • Cartesian graph factorization at logarithmic cost per edge
    • F. Aurenhammer, J. Hagauer and W. Imrich, Cartesian graph factorization at logarithmic cost per edge, Comput. Complexity 2 (1992) 331-349.
    • (1992) Comput. Complexity , vol.2 , pp. 331-349
    • Aurenhammer, F.1    Hagauer, J.2    Imrich, W.3
  • 2
    • 84987486374 scopus 로고
    • Product graph representations
    • T. Feder, Product graph representations, J. Graph Theory 16 (1992) 467-488.
    • (1992) J. Graph Theory , vol.16 , pp. 467-488
    • Feder, T.1
  • 3
    • 0022145160 scopus 로고
    • A polynomial time algorithm for finding the prime factors of Cartesian-product graphs
    • 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.
    • (1985) Discrete Appl. Math. , vol.12 , pp. 123-138
    • Feigenbaum, J.1    Hershberger, J.2    Schäffer, A.A.3
  • 6
    • 0024851078 scopus 로고
    • Embedding graphs into Cartesian products, graph theory and applications: East and West
    • W. Imrich, Embedding graphs into Cartesian products, graph theory and applications: East and West, Ann. New York Acad. Sci. 576 (1989) 266-274.
    • (1989) Ann. New York Acad. Sci. , vol.576 , pp. 266-274
    • Imrich, W.1
  • 7
    • 84987486500 scopus 로고
    • Factoring Cartesian-product graphs
    • W. Imrich and J. Žerovnik, Factoring Cartesian-product graphs, J. Graph Theory 18 (1994) 557-567.
    • (1994) J. Graph Theory , vol.18 , pp. 557-567
    • Imrich, W.1    Žerovnik, J.2
  • 8
    • 84987492119 scopus 로고
    • Coloring graph bundles
    • S. Klavžar and B. Mohar, Coloring graph bundles, J. Graph Theory 19 (1995) 145-155.
    • (1995) J. Graph Theory , vol.19 , pp. 145-155
    • Klavžar, S.1    Mohar, B.2
  • 9
    • 0008727091 scopus 로고
    • The chromatic numbers of graph bundles over cycles
    • S. Klavžar and B. Mohar, The chromatic numbers of graph bundles over cycles, Discrete Math. 138 (1995) 301-314.
    • (1995) Discrete Math. , vol.138 , pp. 301-314
    • Klavžar, S.1    Mohar, B.2
  • 10
    • 0013520623 scopus 로고
    • Isomorphism classes of graph bundles
    • J.H. Kwak and J. Lee, Isomorphism classes of graph bundles, Canadian J. Math. 42 (1990) 747-761.
    • (1990) Canadian J. Math. , vol.42 , pp. 747-761
    • Kwak, J.H.1    Lee, J.2
  • 14
    • 0000692175 scopus 로고
    • Graph multiplication
    • G. Sabidussi, Graph multiplication, Math. Z. 72 (1960) 446-457.
    • (1960) Math. Z. , vol.72 , pp. 446-457
    • Sabidussi, G.1
  • 16
    • 85006169741 scopus 로고
    • Factoring a graph in polynomial time
    • P.M. Winkler, Factoring a graph in polynomial time, European J. Combin. 8 (1987) 209-212.
    • (1987) European J. Combin. , vol.8 , pp. 209-212
    • Winkler, P.M.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.