{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:34Z","timestamp":1740107134367,"version":"3.37.3"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,12,29]],"date-time":"2013-12-29T00:00:00Z","timestamp":1388275200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2015,5]]},"DOI":"10.1007\/s00373-013-1392-y","type":"journal-article","created":{"date-parts":[[2013,12,28]],"date-time":"2013-12-28T01:39:04Z","timestamp":1388194744000},"page":"757-770","source":"Crossref","is-referenced-by-count":0,"title":["The Grid Property and Product-Like Hypergraphs"],"prefix":"10.1007","volume":"31","author":[{"given":"Lydia","family":"Ostermeier","sequence":"first","affiliation":[]},{"given":"Peter F.","family":"Stadler","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,12,29]]},"reference":[{"key":"1392_CR1","first-page":"293","volume":"12","author":"R. Bachman","year":"2012","unstructured":"Bachman R., Fredette E., Fuller J., Landry M., Opperman M., Tamon C., Tollefson A.: Perfect state transfer on quotient graphs. Quant. Inf. Comp. 12, 293\u2013313 (2012)","journal-title":"Quant. Inf. Comp."},{"key":"1392_CR2","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0166-218X(85)90066-6","volume":"12","author":"J. Feigenbaum","year":"1985","unstructured":"Feigenbaum J., Hershberger J., Sch\u00e4ffer A.A.: A polynomial time algorithm for finding the prime factors of cartesian-product graphs. Discrete Appl. Math. 12, 123\u2013138 (1985)","journal-title":"Discrete Appl. Math."},{"key":"1392_CR3","doi-asserted-by":"crossref","unstructured":"Hellmuth, M., Ostermeier, L., Stadler, P.F.: Unique square property, equitable partitions, and product-like graphs. Discrete Math (2013). http:\/\/dx.doi.org\/10.1016\/j.disc.2013.12.012","DOI":"10.1016\/j.disc.2013.12.012"},{"key":"1392_CR4","doi-asserted-by":"crossref","unstructured":"Hellmuth, M., Ostermeier, L., Stadler, P.F.: A survey on hypergraph products. Math. Comp. Sci. 6, 132 (2012)","DOI":"10.1007\/s11786-012-0109-6"},{"key":"1392_CR5","first-page":"285","volume":"2","author":"W. Imrich","year":"1967","unstructured":"Imrich W.: Kartesisches Produkt von Mengensystemen und Graphen. Studia Sci Math Hungar 2, 285\u2013290 (1967)","journal-title":"Studia Sci Math Hungar"},{"key":"1392_CR6","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1002\/jgt.3190180604","volume":"18","author":"W. Imrich","year":"1994","unstructured":"Imrich W., \u017derovnik J.: Factoring Cartesian-product graphs. J. Graph. Th. 18, 557\u2013567 (1994)","journal-title":"J. Graph. Th."},{"key":"1392_CR7","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/S0012-365X(96)00242-7","volume":"167","author":"W. Imrich","year":"1997","unstructured":"Imrich W., Pisanski T., \u017derovnik J.: Recognizing cartesian graph bundles. Discrete Math. 167, 393\u2013403 (1997)","journal-title":"Discrete Math."},{"key":"1392_CR8","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1002\/jgt.20609","volume":"70","author":"L. Ostermeier","year":"2012","unstructured":"Ostermeier L., Hellmuth M., Stadler P.F.: The cartesian product of hypergraphs. J. Graph. Th. 70, 180\u2013196 (2012)","journal-title":"J. Graph. Th."},{"key":"1392_CR9","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/0095-8956(83)90076-X","volume":"35","author":"T. Pisanski","year":"1983","unstructured":"Pisanski T., Shawe-Taylor J., Vrabec J.: Edge-colorability of graph bundles. J. Combinat. Theory Ser. B 35, 12\u201319 (1983)","journal-title":"J. Combinat. Theory Ser. B"},{"key":"1392_CR10","doi-asserted-by":"crossref","first-page":"446","DOI":"10.1007\/BF01162967","volume":"72","author":"G. Sabidussi","year":"1960","unstructured":"Sabidussi G.: Graph multiplication. Math. Z 72, 446\u2013457 (1960)","journal-title":"Math. Z"},{"key":"1392_CR11","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/S0166-218X(01)00296-7","volume":"120","author":"B. Zmazek","year":"2002","unstructured":"Zmazek B., \u017derovnik J.: Algorithm for recognizing cartesian graph bundles. Discrete Appl. Math. 120, 275\u2013302 (2002)","journal-title":"Discrete Appl. Math."},{"key":"1392_CR12","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1016\/S0012-365X(01)00106-6","volume":"244","author":"B. Zmazek","year":"2002","unstructured":"Zmazek B., \u017derovnik J.: Unique square property and fundamental factorizations of graph bundles. Discrete Math. 244, 551\u2013561 (2002)","journal-title":"Discrete Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-013-1392-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-013-1392-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-013-1392-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T10:59:37Z","timestamp":1559041177000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-013-1392-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12,29]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,5]]}},"alternative-id":["1392"],"URL":"https:\/\/doi.org\/10.1007\/s00373-013-1392-y","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2013,12,29]]}}}