{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,7]],"date-time":"2023-08-07T12:30:06Z","timestamp":1691411406350},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2012,5,4]],"date-time":"2012-05-04T00:00:00Z","timestamp":1336089600000},"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":[[2013,9]]},"DOI":"10.1007\/s00373-012-1177-8","type":"journal-article","created":{"date-parts":[[2012,5,3]],"date-time":"2012-05-03T06:15:08Z","timestamp":1336025708000},"page":"1523-1529","source":"Crossref","is-referenced-by-count":7,"title":["Planar Lattice Graphs with Gallai\u2019s Property"],"prefix":"10.1007","volume":"29","author":[{"given":"Faisal","family":"Nadeem","sequence":"first","affiliation":[]},{"given":"Ayesha","family":"Shabbir","sequence":"additional","affiliation":[]},{"given":"Tudor","family":"Zamfirescu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,5,4]]},"reference":[{"key":"1177_CR1","first-page":"362","volume-title":"Theory of Graphs, Proc Tihany 1966","author":"T. Gallai","year":"1968","unstructured":"Gallai T.: Problem 4. In: Erd\u00f6s, P., Katona, G. (eds) Theory of Graphs, Proc Tihany 1966., p. 362. Academic Press, New York (1968)"},{"key":"1177_CR2","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0097-3165(74)90025-9","volume":"17","author":"B. Gr\u00fcnbaum","year":"1974","unstructured":"Gr\u00fcnbaum B.: Vertices missed by longest paths or circuits. J. Comb. Theory A. 17, 31\u201338 (1974)","journal-title":"J. Comb. Theory A."},{"key":"1177_CR3","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1556\/SScMath.36.2000.1-2.15","volume":"36","author":"B. Menke","year":"2000","unstructured":"Menke B.: Longest cycles in grid graphs. Studia Sci. Math. Hung. 36, 201\u2013230 (2000)","journal-title":"Studia Sci. Math. Hung."},{"key":"1177_CR4","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1002\/(SICI)1097-0118(199705)25:1<37::AID-JGT2>3.0.CO;2-J","volume":"25","author":"B. Menke","year":"1997","unstructured":"Menke B., Zamfirescu Ch., Zamfirescu T.: Intersection of longest cycles in grid graphs. J. Graph Theory 25, 37\u201352 (1997)","journal-title":"J. Graph Theory"},{"key":"1177_CR5","first-page":"97","volume":"53","author":"W. Schmitz","year":"1975","unstructured":"Schmitz, W.: \u00dcber l\u00e4ngste Wege und Kreise in Graphen. Rend. Sem. Mat. Univ. Padova 53, 97\u2013103 (1975)","journal-title":"Rend. Sem. Mat. Univ. Padova"},{"key":"1177_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0021-9800(69)80098-0","volume":"6","author":"H. Walther","year":"1969","unstructured":"Walther, H.: \u00dcber die Nichtexistenz eines Knotenpunktes, durch den alle l\u00e4ngstenWege eines Graphen gehen. J. Comb. Theory 6, 1\u20136 (1969)","journal-title":"J. Comb. Theory"},{"key":"1177_CR7","unstructured":"Walther, H., Voss, H.-J.: \u00dcber Kreise in Graphen. VEB Deutscher Verlag der Wissenschaften, Berlin (1974)"},{"issue":"4","key":"1177_CR8","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1002\/jgt.20241","volume":"55","author":"C.T. Zamfirescu","year":"2007","unstructured":"Zamfirescu C.T., Zamfirescu T.I.: A planar hypohamiltonian graph with 48 vertices. J. Graph Theory 55(4), 338\u2013342 (2007)","journal-title":"J. Graph Theory"},{"key":"1177_CR9","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1016\/0095-8956(72)90048-2","volume":"13","author":"T. Zamfirescu","year":"1972","unstructured":"Zamfirescu T.: A two-connected planar graph without concurrent longest paths. J. Combin. Theory B 13, 116\u2013121 (1972)","journal-title":"J. Combin. Theory B"},{"key":"1177_CR10","doi-asserted-by":"crossref","first-page":"211","DOI":"10.7146\/math.scand.a-11630","volume":"38","author":"T. Zamfirescu","year":"1976","unstructured":"Zamfirescu T.: On longest paths and circuits in graphs. Math. Scand. 38, 211\u2013239 (1976)","journal-title":"Math. Scand."},{"key":"1177_CR11","first-page":"1","volume":"28","author":"T. Zamfirescu","year":"2001","unstructured":"Zamfirescu T.: Intersecting longest paths or cycles: a short survey. Analele Univ. Craiova. Seria Mat. Inf. 28, 1\u20139 (2001)","journal-title":"Analele Univ. Craiova. Seria Mat. Inf."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1177-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-012-1177-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1177-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T10:59:33Z","timestamp":1559041173000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-012-1177-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5,4]]},"references-count":11,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2013,9]]}},"alternative-id":["1177"],"URL":"https:\/\/doi.org\/10.1007\/s00373-012-1177-8","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,5,4]]}}}