{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,27]],"date-time":"2025-11-27T20:44:17Z","timestamp":1764276257691},"reference-count":16,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1997,4,1]],"date-time":"1997-04-01T00:00:00Z","timestamp":859852800000},"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":5951,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1997,4]]},"DOI":"10.1016\/s0012-365x(96)00242-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:36:38Z","timestamp":1027618598000},"page":"393-403","source":"Crossref","is-referenced-by-count":19,"special_numbering":"C","title":["Recognizing Cartesian graph bundles"],"prefix":"10.1016","volume":"167-168","author":[{"given":"Wilfried","family":"Imrich","sequence":"first","affiliation":[]},{"given":"Toma\u1e91","family":"Pisanski","sequence":"additional","affiliation":[]},{"given":"Janez","family":"\u1e90erovnik","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(96)00242-7_BIB1","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\/S0012-365X(96)00242-7_BIB2","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\/S0012-365X(96)00242-7_BIB3","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\/S0012-365X(96)00242-7_BIB4","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1090\/S0002-9947-1985-0776391-5","article-title":"On isometric embeddings of graphs","volume":"288","author":"Graham","year":"1985","journal-title":"Trans. Amer. Math. Soc."},{"year":"1993","series-title":"Recognizing graphs of windex 2","author":"Hagauer","key":"10.1016\/S0012-365X(96)00242-7_BIB5"},{"key":"10.1016\/S0012-365X(96)00242-7_BIB6","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1111\/j.1749-6632.1989.tb16407.x","article-title":"Embedding graphs into Cartesian products, graph theory and applications: East and West","volume":"576","author":"Imrich","year":"1989","journal-title":"Ann. New York Acad. Sci."},{"key":"10.1016\/S0012-365X(96)00242-7_BIB7","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\/S0012-365X(96)00242-7_BIB8","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1002\/jgt.3190190203","article-title":"Coloring graph bundles","volume":"19","author":"Klav\u017aar","year":"1995","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(96)00242-7_BIB9","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\u017aar","year":"1995","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(96)00242-7_BIB10","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":"Canadian J. Math."},{"key":"10.1016\/S0012-365X(96)00242-7_BIB11","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\/S0012-365X(96)00242-7_BIB12","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/0095-8956(83)90076-X","article-title":"Edge-colorability of graph bundles","volume":"35","author":"Pisanski","year":"1983","journal-title":"J. Combin. Theory Ser. B"},{"year":"1982","series-title":"Graph bundles","author":"Pisanski","key":"10.1016\/S0012-365X(96)00242-7_BIB13"},{"key":"10.1016\/S0012-365X(96)00242-7_BIB14","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."},{"year":"1995","series-title":"Vega Version 0.2: Quick Reference Manual and Vega Graph Gallery","key":"10.1016\/S0012-365X(96)00242-7_BIB15"},{"key":"10.1016\/S0012-365X(96)00242-7_BIB16","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."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X96002427?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X96002427?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T18:27:40Z","timestamp":1556130460000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X96002427"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,4]]},"references-count":16,"alternative-id":["S0012365X96002427"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(96)00242-7","relation":{},"ISSN":["0012-365X"],"issn-type":[{"type":"print","value":"0012-365X"}],"subject":[],"published":{"date-parts":[[1997,4]]}}}