{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,27]],"date-time":"2025-07-27T07:36:44Z","timestamp":1753601804976},"reference-count":22,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2002,8,1]],"date-time":"2002-08-01T00:00:00Z","timestamp":1028160000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4003,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2002,8]]},"DOI":"10.1016\/s0166-218x(01)00296-7","type":"journal-article","created":{"date-parts":[[2002,10,11]],"date-time":"2002-10-11T12:43:22Z","timestamp":1034340202000},"page":"275-302","source":"Crossref","is-referenced-by-count":19,"title":["Algorithm for recognizing Cartesian graph bundles"],"prefix":"10.1016","volume":"120","author":[{"given":"Bla\u017e","family":"Zmazek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Janez","family":"\u017derovnik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(01)00296-7_BIB1","first-page":"103","article-title":"On the complexity and combinatorics of covering finite complexes","volume":"4","author":"Abello","year":"1991","journal-title":"Australasian J. Combin."},{"key":"10.1016\/S0166-218X(01)00296-7_BIB2","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/BF01200428","article-title":"Cartesian graph factorization at logarithmic cost per edge","volume":"2","author":"Aurenhammer","year":"1992","journal-title":"Comput. Complexity"},{"key":"10.1016\/S0166-218X(01)00296-7_BIB3","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1002\/jgt.3190160508","article-title":"Product graph representations","volume":"16","author":"Feder","year":"1992","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0166-218X(01)00296-7_BIB4","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0166-218X(85)90066-6","article-title":"A polynomial time algorithm for finding the prime factors of Cartesian-product graphs","volume":"12","author":"Feigenbaum","year":"1985","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(01)00296-7_BIB5","series-title":"Fibre Bundles","author":"Husemoller","year":"1993"},{"key":"10.1016\/S0166-218X(01)00296-7_BIB6","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/BF01472575","article-title":"Associative products of graphs","volume":"80","author":"Imrich","year":"1975","journal-title":"Monat. f\u00fcr Math."},{"key":"10.1016\/S0166-218X(01)00296-7_BIB7","series-title":"Product Graphs, Structure and Recognition","author":"Imrich","year":"2000"},{"key":"10.1016\/S0166-218X(01)00296-7_BIB8","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/S0012-365X(96)00242-7","article-title":"Recognizing Cartesian graph bundles","volume":"167, 168","author":"Imrich","year":"1998","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(01)00296-7_BIB9","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1002\/jgt.3190180604","article-title":"Factoring Cartesian-product graphs","volume":"18","author":"Imrich","year":"1994","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0166-218X(01)00296-7_BIB10","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1002\/jgt.3190190203","article-title":"Coloring graph bundles","volume":"19","author":"Klav\u017ear","year":"1995","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0166-218X(01)00296-7_BIB11","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/0012-365X(94)00212-2","article-title":"The chromatic numbers of graph bundles over cycles","volume":"138","author":"Klav\u017ear","year":"1995","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(01)00296-7_BIB12","doi-asserted-by":"crossref","first-page":"747","DOI":"10.4153\/CJM-1990-039-3","article-title":"Isomorphism classes of graph bundles","volume":"42","author":"Kwak","year":"1990","journal-title":"Canad. J. Math."},{"key":"10.1016\/S0166-218X(01)00296-7_BIB13","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1080\/03081089208818147","article-title":"Characteristic polynomials of some graph bundles II","volume":"32","author":"Kwak","year":"1992","journal-title":"Linear Multilinear Algebra"},{"key":"10.1016\/S0166-218X(01)00296-7_BIB14","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/S0195-6698(88)80012-X","article-title":"The maximum genus of graph bundles","volume":"9","author":"Mohar","year":"1988","journal-title":"European J. Combin."},{"key":"10.1016\/S0166-218X(01)00296-7_BIB15","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/0095-8956(83)90076-X","article-title":"Edge-colorability of graph bundles","volume":"B35","author":"Pisanski","year":"1983","journal-title":"J. Combin. Theory Ser."},{"key":"10.1016\/S0166-218X(01)00296-7_BIB16","unstructured":"T. Pisanski, J. Vrabec, Graph bundles, 1982, unpublished manuscript."},{"key":"10.1016\/S0166-218X(01)00296-7_BIB17","doi-asserted-by":"crossref","first-page":"446","DOI":"10.1007\/BF01162967","article-title":"Graph multiplication","volume":"72","author":"Sabidussi","year":"1960","journal-title":"Math. Z."},{"key":"10.1016\/S0166-218X(01)00296-7_BIB18","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1155\/S0161171294000748","article-title":"Characteristic polynomials of some weighted graph bundles and its application to links","volume":"17","author":"Sohn","year":"1994","journal-title":"Internat. J. Math. Math. Sci."},{"key":"10.1016\/S0166-218X(01)00296-7_BIB19","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/S0195-6698(87)80012-4","article-title":"Factoring a graph in polynomial time","volume":"8","author":"Winkler","year":"1987","journal-title":"European J. Combin."},{"key":"10.1016\/S0166-218X(01)00296-7_BIB20","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1016\/S0012-365X(00)00254-5","article-title":"On recognizing Cartesian graph bundles","volume":"233","author":"Zmazek","year":"2001","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(01)00296-7_BIB21","doi-asserted-by":"crossref","unstructured":"B. Zmazek, J. \u017derovnik, Unique square property and fundamental factorization, Discrete Math., 244 (2002) 103.","DOI":"10.1016\/S0012-365X(01)00106-6"},{"key":"10.1016\/S0166-218X(01)00296-7_BIB22","series-title":"SOFSEM\u201996: Theory and Practise of Informatics","first-page":"467","article-title":"Recognizing graph product and bundles","volume":"Vol. 1175","author":"\u017derovnik","year":"1996"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X01002967?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X01002967?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,11]],"date-time":"2019-04-11T06:51:17Z","timestamp":1554965477000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X01002967"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,8]]},"references-count":22,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2002,8]]}},"alternative-id":["S0166218X01002967"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(01)00296-7","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2002,8]]}}}