{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,4]],"date-time":"2025-12-04T14:35:57Z","timestamp":1764858957112,"version":"3.37.3"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2017,6,21]],"date-time":"2017-06-21T00:00:00Z","timestamp":1498003200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000893","name":"Simons Foundation","doi-asserted-by":"publisher","award":["429625"],"award-info":[{"award-number":["429625"]}],"id":[{"id":"10.13039\/100000893","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2017,9]]},"DOI":"10.1007\/s00373-017-1823-2","type":"journal-article","created":{"date-parts":[[2017,6,21]],"date-time":"2017-06-21T15:24:23Z","timestamp":1498058663000},"page":"1095-1101","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Spanning Trails with Maximum Degree at Most 4 in \n                $$2K_2$$\n                \n                    \n                                    \n                        \n                            2\n                            \n                                K\n                                2\n                            \n                        \n                    \n                \n            -Free Graphs"],"prefix":"10.1007","volume":"33","author":[{"given":"Guantao","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. N.","family":"Ellingham","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Akira","family":"Saito","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Songling","family":"Shan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,6,21]]},"reference":[{"key":"1823_CR1","doi-asserted-by":"crossref","unstructured":"Bauer, D., Broersma, H.J., Veldman, H.J.: Not every 2-tough graph is Hamiltonian. In: Proceedings of the 5th Twente Workshop on Graphs and Combinatorial Optimization (Enschede, 1997), vol. 99, pp. 317\u2013321 (2000)","DOI":"10.1016\/S0166-218X(99)00141-9"},{"issue":"1","key":"1823_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00373-006-0649-0","volume":"22","author":"D Bauer","year":"2006","unstructured":"Bauer, D., Broersma, H.J., Schmeichel, E.: Toughness in graphs\u2014a survey. Graphs Combin. 22(1), 1\u201335 (2006)","journal-title":"Graphs Combin."},{"issue":"3","key":"1823_CR3","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1002\/jgt.21734","volume":"75","author":"H Broersma","year":"2014","unstructured":"Broersma, H., Patel, V., Pyatkin, A.: On toughness and Hamiltonicity of \n                        $$2K_2$$\n                        \n                            \n                                            \n                                \n                                    2\n                                    \n                                        K\n                                        2\n                                    \n                                \n                            \n                        \n                    -free graphs. J. Graph Theory 75(3), 244\u2013255 (2014)","journal-title":"J. Graph Theory"},{"issue":"2","key":"1823_CR4","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0012-365X(90)90144-7","volume":"81","author":"FRK Chung","year":"1990","unstructured":"Chung, F.R.K., Gy\u00e1rf\u00e1s, A., Tuza, Z., Trotter, W.T.: The maximum number of edges in \n                        $$2K_2$$\n                        \n                            \n                                            \n                                \n                                    2\n                                    \n                                        K\n                                        2\n                                    \n                                \n                            \n                        \n                    -free graphs of bounded degree. Discrete Math. 81(2), 129\u2013135 (1990)","journal-title":"Discrete Math."},{"key":"1823_CR5","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0012-365X(73)90138-6","volume":"5","author":"V Chv\u00e1tal","year":"1973","unstructured":"Chv\u00e1tal, V.: Tough graphs and Hamiltonian circuits. Discrete Math. 5, 215\u2013228 (1973)","journal-title":"Discrete Math."},{"issue":"4","key":"1823_CR6","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF02579243","volume":"5","author":"M El-Zahar","year":"1985","unstructured":"El-Zahar, M., Erd\u0151s, P.: On the existence of two nonneighboring subgraphs in a graph. Combinatorica 5(4), 295\u2013300 (1985)","journal-title":"Combinatorica"},{"issue":"4","key":"1823_CR7","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1002\/jgt.10162","volume":"45","author":"MN Ellingham","year":"2004","unstructured":"Ellingham, M.N., Zha, X., Zhang, Y.: Spanning 2-trails from degree sum conditions. J. Graph Theory 45(4), 298\u2013319 (2004)","journal-title":"J. Graph Theory"},{"key":"1823_CR8","unstructured":"Gao, M., Pasechnik, D.: On \n                        $$k$$\n                        \n                            \n                                            \n                                k\n                            \n                        \n                    -walks in \n                        $$2{K}_2$$\n                        \n                            \n                                            \n                                \n                                    2\n                                    \n                                        K\n                                        2\n                                    \n                                \n                            \n                        \n                    -free graphs. (2014) \n                        arXiv:1412.0514v2"},{"issue":"12","key":"1823_CR9","first-page":"1642011.1","volume":"25","author":"M Gao","year":"2016","unstructured":"Gao, M., Pasechnik, D.: Edge-dominating cycles, \n                        $$k$$\n                        \n                            \n                                            \n                                k\n                            \n                        \n                    -walks and hamilton prisms in \n                        $$2{K}_2$$\n                        \n                            \n                                            \n                                \n                                    2\n                                    \n                                        K\n                                        2\n                                    \n                                \n                            \n                        \n                    -free graphs. J. Knot Theory Ramif 25(12), 1642011.1\u20131642011.9 (2016)","journal-title":"J. Knot Theory Ramif"},{"key":"1823_CR10","unstructured":"Jackson, B\u00a0., Wormald, N\u00a0.C.: \n                        $$k$$\n                        \n                            \n                                            \n                                k\n                            \n                        \n                    -walks of graphs. Australas. J. Combin 2, 135\u2013146 (1990). Combinatorial mathematics and combinatorial computing, vol. 2 (Brisbane, 1989)"},{"key":"1823_CR11","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/j.dam.2015.07.013","volume":"200","author":"Ping Li","year":"2016","unstructured":"Li, Ping, Li, Hao, Chen, Ye, Fleischner, Herbert, Lai, Hong-Jian: Supereulerian graphs with width \n                        $$s$$\n                        \n                            \n                                            \n                                s\n                            \n                        \n                     and \n                        $$s$$\n                        \n                            \n                                            \n                                s\n                            \n                        \n                    -collapsible graphs. Discrete Appl. Math. 200, 79\u201394 (2016)","journal-title":"Discrete Appl. Math."},{"issue":"24","key":"1823_CR12","doi-asserted-by":"crossref","first-page":"3327","DOI":"10.1016\/j.disc.2006.07.001","volume":"306","author":"D Meister","year":"2006","unstructured":"Meister, D.: Two characterisations of minimal triangulations of \n                        $$2K_2$$\n                        \n                            \n                                            \n                                \n                                    2\n                                    \n                                        K\n                                        2\n                                    \n                                \n                            \n                        \n                    -free graphs. Discrete Math. 306(24), 3327\u20133333 (2006)","journal-title":"Discrete Math."},{"issue":"2","key":"1823_CR13","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/BF02350634","volume":"8","author":"M Paoli","year":"1992","unstructured":"Paoli, M., Peck, G.W., Trotter Jr., W.T., West, D.B.: Large regular graphs with no induced \n                        $$2K_2$$\n                        \n                            \n                                            \n                                \n                                    2\n                                    \n                                        K\n                                        2\n                                    \n                                \n                            \n                        \n                    . Graphs Combin. 8(2), 165\u2013197 (1992)","journal-title":"Graphs Combin."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-017-1823-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-017-1823-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-017-1823-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,10,19]],"date-time":"2017-10-19T15:32:02Z","timestamp":1508427122000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-017-1823-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,21]]},"references-count":13,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2017,9]]}},"alternative-id":["1823"],"URL":"https:\/\/doi.org\/10.1007\/s00373-017-1823-2","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2017,6,21]]}}}