{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T14:12:42Z","timestamp":1725459162390},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540619949"},{"type":"electronic","value":"9783540495888"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/bfb0037431","type":"book-chapter","created":{"date-parts":[[2006,1,25]],"date-time":"2006-01-25T15:15:55Z","timestamp":1138202155000},"page":"467-474","source":"Crossref","is-referenced-by-count":1,"title":["Recognizing graph products and bundles"],"prefix":"10.1007","author":[{"given":"Janez","family":"\u017derovnik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,26]]},"reference":[{"key":"39_CR1","first-page":"103","volume":"4","author":"J. Abello","year":"1991","unstructured":"J.Abello, M.R.Fellows and J.C.Stillwell: On the Complexity and Combinatorics of Covering Finite Complexes, Australasian Journal of Combinatorics 4 (1991) 103\u2013112.","journal-title":"Australasian Journal of Combinatorics"},{"key":"39_CR2","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/BF01200428","volume":"2","author":"F. Aurenhammer","year":"1992","unstructured":"F.Aurenhammer, J.Hagauer and W.Imrich: Cartesian Graph Factorization at Logarithmic Cost per Edge, Computational Complexity 2 (1992) 331\u2013349.","journal-title":"Computational Complexity"},{"key":"39_CR3","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0166-218X(94)90154-6","volume":"52","author":"F. Aurenhammer","year":"1994","unstructured":"F.Aurenhammer, M.Formann, R.Idury, A.Sch\u00e4ffer and F.Wagner: Faster Isometric Embedding in Products of Complete Graphs, Discrete Applied Mathematics 52 (1994) 17\u201328.","journal-title":"Discrete Applied Mathematics"},{"key":"39_CR4","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1002\/jgt.3190160508","volume":"16","author":"T. Feder","year":"1992","unstructured":"T.Feder: Product Graph Representations, Journal of Graph Theory 16 (1992) 467\u2013488.","journal-title":"Journal of Graph Theory"},{"key":"39_CR5","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0166-218X(85)90066-6","volume":"12","author":"J. Feigenbaum","year":"1985","unstructured":"J.Feigenbaum, J.Hershberger and A.A.Sch\u00e4ffer: A Polynomial Time Algorithm for Finding the Prime Factors of Cartesian-Product Graphs, Discrete Applied Mathematics 12 (1985) 123\u2013138.","journal-title":"Discrete Applied Mathematics"},{"key":"39_CR6","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1137\/0402017","volume":"2","author":"J. Feigenbaum","year":"1989","unstructured":"J. Feigenbaum, R. Haddad: On Factorable Extensions and Subgraphs of Prime Graphs, SIAM J. Disc. Math 2 (1989) 197\u2013218.","journal-title":"SIAM J. Disc. Math"},{"key":"39_CR7","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1137\/0215045","volume":"15","author":"J. Feigenbaum","year":"1986","unstructured":"J.Feigenbaum and A.A.Sch\u00e4ffer: Recognizing composite graphs is equivalent to testing graph isomorphism, SIAM J.Comp. 15 (1986) 619\u2013627.","journal-title":"SIAM J.Comp."},{"key":"39_CR8","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0012-365X(92)90280-S","volume":"109","author":"J. Feigenbaum","year":"1992","unstructured":"J.Feigenbaum and A.A.Sch\u00e4ffer: Finding the Prime Factors of Strong Direct Product Graphs in Polynomial Time, Discrete Math. 109 (1992) 77\u2013102.","journal-title":"Discrete Math."},{"key":"39_CR9","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1090\/S0002-9947-1985-0776391-5","volume":"288","author":"R.L. Graham","year":"1985","unstructured":"R.L.Graham and P.M.Winkler: On Isometric Embeddings of Graphs, Transactions of the American Mathematical Society 288 (1985) 527\u2013536.","journal-title":"Transactions of the American Mathematical Society"},{"key":"39_CR10","unstructured":"J. Hagauer, W. Imrich and S. Klav\u017ear: Recognizing graphs of windex 2, Preprint, 1993."},{"key":"39_CR11","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/BF01472575","volume":"80","author":"W. Imrich","year":"1975","unstructured":"W.Imrich and H.Izbicki: Associative Products of Graphs, Monat. f\u00fcr Math. 80 (1975) 277\u2013281.","journal-title":"Monat. f\u00fcr Math."},{"key":"39_CR12","first-page":"45","volume":"9","author":"W. Imrich","year":"1993","unstructured":"W.Imrich and S.Klav\u017ear: A simple O(mn) algorithm for recognizing Hamming graphs, Bull. Inst. Combin. Appl. 9 (1993) 45\u201356.","journal-title":"Bull. Inst. Combin. Appl."},{"key":"39_CR13","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1002\/jgt.3190180604","volume":"18","author":"W. Imrich","year":"1994","unstructured":"W.Imrich and J.\u017derovnik: Factoring Cartesian-product Graphs, Journal of Graph Theory 18 (1994) 557\u2013567.","journal-title":"Journal of Graph Theory"},{"key":"39_CR14","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0012-365X(95)00185-Y","volume":"150","author":"W. Imrich","year":"1996","unstructured":"W.Imrich and J.\u017derovnik: On the weak reconstruction of Cartesian-product graphs, Discrete Mathematics, vol. 150 (1996) 167\u2013178.","journal-title":"Discrete Mathematics"},{"key":"39_CR15","unstructured":"W.Imrich, T.Pisanski and J.\u017derovnik, Recognizing Cartesian graph bundles, to appear in Discrete Mathematics."},{"key":"39_CR16","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/BF02280291","volume":"18","author":"L. Lovasz","year":"1967","unstructured":"L.Lovasz: Operations with structures, Acta Math. Acad. Sci. Hungaricae 18 (1967) 321\u2013328.","journal-title":"Acta Math. Acad. Sci. Hungaricae"},{"key":"39_CR17","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/0095-8956(83)90076-X","volume":"35","author":"T. Pisanski","year":"1983","unstructured":"T.Pisanski, J.Shawe-Taylor and J.Vrabec, Edge-colorability of graph bundles. Journal of Combinatorial Theory Series B 35 (1983) 12\u201319.","journal-title":"Journal of Combinatorial Theory Series B"},{"key":"39_CR18","unstructured":"T.Pisanski and J.Vrabec, Graph bundles, unpublished manuscript, 1982."},{"key":"39_CR19","doi-asserted-by":"crossref","first-page":"446","DOI":"10.1007\/BF01162967","volume":"72","author":"G. Sabidussi","year":"1960","unstructured":"G.Sabidussi: Graph Multiplication, Mathematische Zeitschrift 72 (1960) 446\u2013457.","journal-title":"Mathematische Zeitschrift"},{"key":"39_CR20","first-page":"30","volume":"9","author":"V.G. Vizing","year":"1963","unstructured":"V.G.Vizing: The Cartesian Product of Graphs (in Russian), Vy\u010disl.Syst. 9 (1963) 30\u201343, (English translation: Comp.El.Syst. 2 (1966) 352\u2013365).","journal-title":"Vy\u010disl.Syst."},{"key":"39_CR21","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/S0195-6698(87)80012-4","volume":"8","author":"P.M. Winkler","year":"1987","unstructured":"P.M.Winkler: Factoring a Graph in Polynomial Time, European Journal of Combinatorics 8 (1987) 209\u2013212.","journal-title":"European Journal of Combinatorics"},{"key":"39_CR22","volume-title":"A simple algorithm for factoring Cartesian product graphs, Arbeitsbericht 5","author":"J. \u017derovnik","year":"1991","unstructured":"J.\u017derovnik, A simple algorithm for factoring Cartesian product graphs, Arbeitsbericht 5\/1991, Montanuniversitaet Leoben."},{"key":"39_CR23","unstructured":"J.Hagauer and J.\u017derovnik, An algorithm for the weak reconstruction of Cartesian-product graphs, submitted. (also in Preprint Series Vol.33 (1995) 470, Department of Mathematics, University of Ljubljana.)"},{"key":"39_CR24","unstructured":"J.\u017derovnik, Recognizing strong bundles, in preparation."}],"container-title":["Lecture Notes in Computer Science","SOFSEM'96: Theory and Practice of Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0037431","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,9]],"date-time":"2019-02-09T08:51:07Z","timestamp":1549702267000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0037431"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540619949","9783540495888"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/bfb0037431","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}