{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T05:26:23Z","timestamp":1767245183097},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2012,5,15]],"date-time":"2012-05-15T00:00:00Z","timestamp":1337040000000},"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-1185-8","type":"journal-article","created":{"date-parts":[[2012,5,14]],"date-time":"2012-05-14T10:09:16Z","timestamp":1336990156000},"page":"1311-1327","source":"Crossref","is-referenced-by-count":8,"title":["On Planar Toeplitz Graphs"],"prefix":"10.1007","volume":"29","author":[{"given":"Reinhardt","family":"Euler","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tudor","family":"Zamfirescu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,5,15]]},"reference":[{"key":"1185_CR1","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1002\/(SICI)1097-0118(199708)25:4<287::AID-JGT6>3.0.CO;2-G","volume":"25","author":"J.-J. Chen","year":"1997","unstructured":"Chen J.-J., Chang G.J., Huang K.-C.: Integral distance graphs. J. Graph Theory 25, 287\u2013294 (1997)","journal-title":"J. Graph Theory"},{"key":"1185_CR2","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/0012-365X(95)00111-9","volume":"159","author":"R. Dal van","year":"1996","unstructured":"van Dal R., Tijssen G., Tuza Z., van der Veen J., Zamfirescu C.H., Zamfirescu T.: Hamiltonian properties of Toeplitz graphs. Discret. Math. 159, 69\u201381 (1996)","journal-title":"Discret. Math."},{"key":"1185_CR3","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/S0304-3975(00)00230-9","volume":"263","author":"R. Euler","year":"2001","unstructured":"Euler R.: Characterizing bipartite Toeplitz graphs. Theor. Comput. Sci 263, 47\u201358 (2001)","journal-title":"Theor. Comput. Sci"},{"key":"1185_CR4","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/S0012-365X(03)00315-7","volume":"276","author":"R. Euler","year":"2004","unstructured":"Euler R.: Coloring planar Toeplitz graphs and the stable set polytope. Discret. Math. 276, 183\u2013200 (2004)","journal-title":"Discret. Math."},{"key":"1185_CR5","unstructured":"Euler, R.: The Fibonacci number of a grid graph and a new class of integer sequences. J. Integer Seq. 8 (2005) (Article 05.2.6)"},{"key":"1185_CR6","first-page":"119","volume-title":"Combinatorics and Graph Theory\u201995, vol. 1","author":"R. Euler","year":"1995","unstructured":"Euler R., Le Verge H., Zamfirescu T.: A characterization of infinite, bipartite Toeplitz graphs. In: Ku, Tung-Hsin (ed.) Combinatorics and Graph Theory\u201995, vol. 1, pp. 119\u2013130. Academia Sinica, World Scientific (1995)"},{"key":"1185_CR7","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1002\/jgt.3190110403","volume":"11","author":"Z. F\u00fcredi","year":"1987","unstructured":"F\u00fcredi Z.: The number of maximal independent sets in connected graphs. J. Graph Theory 11, 463\u2013470 (1987)","journal-title":"J. Graph Theory"},{"key":"1185_CR8","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0012-365X(01)00136-4","volume":"245","author":"C. Heuberger","year":"2002","unstructured":"Heuberger C.: On hamiltonian Toeplitz graphs. Discret. Math. 245, 107\u2013125 (2002)","journal-title":"Discret. Math."},{"key":"1185_CR9","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/S0012-365X(02)00685-4","volume":"268","author":"C. Heuberger","year":"2003","unstructured":"Heuberger C.: On planarity and colorability of circulant graphs. Discret. Math. 268, 153\u2013169 (2003)","journal-title":"Discret. Math."},{"key":"1185_CR10","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/S0012-365X(00)00243-0","volume":"233","author":"A. Kemnitz","year":"2001","unstructured":"Kemnitz A., Marangio M.: Chromatic numbers of integer distance graphs. Discret. Math. 233, 239\u2013246 (2001)","journal-title":"Discret. Math."},{"key":"1185_CR11","unstructured":"Malik, S. Qureshi, A.M.: Hamiltonian cycles in directed Toeplitz graphs. Ars Combin. (to appear)"},{"issue":"2","key":"1185_CR12","first-page":"145","volume":"53","author":"S. Malik","year":"2010","unstructured":"Malik S., Zamfirescu T.: Hamiltonian connectedness in directed Toeplitz graphs. Bull. Math. Soc. Sci. Math. Roum. 53(2), 145\u2013156 (2010)","journal-title":"Bull. Math. Soc. Sci. Math. Roum."},{"key":"1185_CR13","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/BF02760024","volume":"3","author":"J.W. Moon","year":"1965","unstructured":"Moon J.W., Moser L.: On cliques in graphs. Israel J. Math. 3, 23\u201328 (1965)","journal-title":"Israel J. Math."},{"key":"1185_CR14","unstructured":"Nicoloso, S., Pietropaoli, U.: On the chromatic number of Toeplitz graphs. Working Paper R.10-13, IASI-CNR, 10\/2010, Discret. Appl. Math. (to appear)"},{"key":"1185_CR15","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511805967","volume-title":"Enumerative Combinatorics, vol.1","author":"R.P. Stanley","year":"1997","unstructured":"Stanley R.P.: Enumerative Combinatorics, vol.1. Cambridge University Press, New York (1997)"},{"key":"1185_CR16","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1137\/S0097539797321602","volume":"31","author":"S.P. Vadhan","year":"2001","unstructured":"Vadhan S.P.: The complexity of counting in sparse, regular and planar graphs. SIAM J. Comput. 31, 398\u2013427 (2001)","journal-title":"SIAM J. Comput."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1185-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-012-1185-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-1185-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:59:33Z","timestamp":1559055573000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-012-1185-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5,15]]},"references-count":16,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2013,9]]}},"alternative-id":["1185"],"URL":"https:\/\/doi.org\/10.1007\/s00373-012-1185-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,15]]}}}