{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T04:16:41Z","timestamp":1751516201986,"version":"3.41.0"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319774039"},{"type":"electronic","value":"9783319774046"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-77404-6_41","type":"book-chapter","created":{"date-parts":[[2018,3,12]],"date-time":"2018-03-12T10:03:11Z","timestamp":1520848991000},"page":"558-571","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Transversals of Longest Cycles in Chordal and Bounded Tree-Width Graphs"],"prefix":"10.1007","author":[{"given":"Juan","family":"Guti\u00e9rrez","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,3,13]]},"reference":[{"key":"41_CR1","unstructured":"Gr\u00f6tschel, M.: On intersections of longest cycles. In: Bollob\u00e1s, B. (ed.) Graph Theory and Combinatorics, pp. 171\u2013189 (1984)"},{"key":"41_CR2","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/BFb0070410","volume-title":"Theory and Applications of Graphs","author":"C Thomassen","year":"1978","unstructured":"Thomassen, C.: Hypohamiltonian graphs and digraphs. In: Alavi, Y., Lick, D.R. (eds.) Theory and Applications of Graphs. LNM, vol. 642, pp. 557\u2013571. Springer, Heidelberg (1978). https:\/\/doi.org\/10.1007\/BFb0070410"},{"issue":"1","key":"41_CR3","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1137\/130910658","volume":"28","author":"D Rautenbach","year":"2014","unstructured":"Rautenbach, D., Sereni, J.S.: Transversals of longest paths and cycles. SIAM J. Discret. Math. 28(1), 335\u2013341 (2014)","journal-title":"SIAM J. Discret. Math."},{"key":"41_CR4","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.dam.2016.02.002","volume":"206","author":"A Jobson","year":"2016","unstructured":"Jobson, A., Kzdy, A., Lehel, J., White, S.: Detour trees. Discret. Appl. Math. 206, 73\u201380 (2016)","journal-title":"Discret. Appl. Math."},{"issue":"Suppl. C","key":"41_CR5","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/j.dam.2015.01.010","volume":"186","author":"SA van Aardt","year":"2015","unstructured":"van Aardt, S.A., Burger, A.P., Dunbar, J.E., Frick, M., Llano, B., Thomassen, C., Zuazua, R.: Destroying longest cycles in graphs and digraphs. Discret. Appl. Math. 186(Suppl. C), 251\u2013259 (2015)","journal-title":"Discret. Appl. Math."},{"key":"41_CR6","doi-asserted-by":"crossref","unstructured":"Fernandes, C., Guti\u00e9rrez, J.: Hitting all longest cycles in a graph. In: Anais do XXXVII congresso da sociedade brasileira de computa\u00e7\u00e3o, pp. 87\u201390 (2017)","DOI":"10.5753\/etc.2017.3185"},{"issue":"3","key":"41_CR7","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1017\/S0963548304006145","volume":"13","author":"P Balister","year":"2004","unstructured":"Balister, P., Gy\u0151ri, E., Lehel, J., Schelp, R.: Longest paths in circular arc graphs. Comb. Probab. Comput. 13(3), 311\u2013317 (2004)","journal-title":"Comb. Probab. Comput."},{"key":"41_CR8","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/j.endm.2016.10.035","volume":"55","author":"M Cerioli","year":"2016","unstructured":"Cerioli, M., Lima, P.: Intersection of longest paths in graph classes. Electron. Notes Discret. Math. 55, 139\u2013142 (2016)","journal-title":"Electron. Notes Discret. Math."},{"issue":"140","key":"41_CR9","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/s10587-015-0193-2","volume":"65","author":"F Chen","year":"2015","unstructured":"Chen, F.: Nonempty intersection of longest paths in a graph with a small matching number. Czechoslov. Math. J. 65(140), 545\u2013553 (2015)","journal-title":"Czechoslov. Math. J."},{"issue":"3","key":"41_CR10","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/j.disc.2016.07.023","volume":"340","author":"G Chen","year":"2017","unstructured":"Chen, G., Ehrenm\u00fcller, J., Fernandes, C., Heise, C., Shan, S., Yang, P., Yates, A.: Nonempty intersection of longest paths in seriesparallel graphs. Discret. Math. 340(3), 287\u2013304 (2017)","journal-title":"Discret. Math."},{"key":"41_CR11","doi-asserted-by":"publisher","first-page":"1401","DOI":"10.1016\/j.disc.2013.02.016","volume":"313","author":"S de Rezende","year":"2013","unstructured":"de Rezende, S., Fernandes, C., Martin, D., Wakabayashi, Y.: Intersecting longest paths. Discret. Math. 313, 1401\u20131408 (2013)","journal-title":"Discret. Math."},{"key":"41_CR12","unstructured":"Golan, G., Shan, S.: Nonempty intersection of longest paths in $$2{K_2}$$-free graphs. https:\/\/arxiv.org\/abs\/1611.05967 (2016)"},{"key":"41_CR13","first-page":"43","volume":"29","author":"S Klav\u017ear","year":"1990","unstructured":"Klav\u017ear, S., Petkov\u0161ek, M.: Graphs with nonempty intersection of longest paths. Ars Comb. 29, 43\u201352 (1990)","journal-title":"Ars Comb."},{"issue":"2","key":"41_CR14","doi-asserted-by":"publisher","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(2), 211\u2013239 (1976)","journal-title":"Math. Scand."},{"issue":"Suppl. C","key":"41_CR15","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/j.endm.2017.10.024","volume":"62","author":"MR Cerioli","year":"2017","unstructured":"Cerioli, M.R., Fernandes, C.G., G\u00f3mez, R., Guti\u00e9rrez, J., Lima, P.T.: Transversals of longest paths. Electron. Notes Discret. Math. 62(Suppl. C), 135\u2013140 (2017). IX Latin and American Algorithms, Graphs and Optimization, LAGOS 2017","journal-title":"Electron. Notes Discret. Math."},{"key":"41_CR16","doi-asserted-by":"crossref","unstructured":"Cerioli, M.R., Fernandes, C.G., G\u00f3mez, R., Guti\u00e9rrez, J., Lima, P.T.: Transversals of longest paths (2017). https:\/\/arxiv.org\/abs\/1712.07086","DOI":"10.1016\/j.endm.2017.10.024"},{"issue":"1","key":"41_CR17","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1006\/jctb.1997.1802","volume":"72","author":"G Chen","year":"1998","unstructured":"Chen, G., Faudree, R.J., Gould, R.J.: Intersections of longest cycles in k-connected graphs. J. Comb. Theory Ser. B 72(1), 143\u2013149 (1998)","journal-title":"J. Comb. Theory Ser. B"},{"key":"41_CR18","unstructured":"Hippchen, T.: Intersections of longest paths and cycles. Ph.D. thesis, Georgia State University (2008)"},{"issue":"5","key":"41_CR19","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1006\/eujc.1996.0085","volume":"18","author":"S Jendrol","year":"1997","unstructured":"Jendrol, S., Skupie\u0144, Z.: Exact numbers of longest cycles with empty intersection. Eur. J. Comb. 18(5), 575\u2013578 (1997)","journal-title":"Eur. J. Comb."},{"issue":"1","key":"41_CR20","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1080\/10586458.1995.10504306","volume":"4","author":"IA Stewart","year":"1995","unstructured":"Stewart, I.A., Thompson, B.: On the intersections of longest cycles in a graph. Exp. Math. 4(1), 41\u201348 (1995)","journal-title":"Exp. Math."},{"key":"41_CR21","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53622-3","volume-title":"Graph Theory","author":"R Diestel","year":"2017","unstructured":"Diestel, R.: Graph Theory. GTM, vol. 173, 4th edn. Springer, Heidelberg (2017)","edition":"4"},{"issue":"1","key":"41_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(97)00228-4","volume":"209","author":"H Bodlaender","year":"1998","unstructured":"Bodlaender, H.: A partial $$k$$-arboretum of graphs with bounded treewidth. Theor. Comput. Sci. 209(1), 1\u201345 (1998)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"41_CR23","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0095-8956(74)90094-X","volume":"16","author":"F Gavril","year":"1974","unstructured":"Gavril, F.: The intersection graphs of subtrees in trees are exactly the chordal graphs. J. Comb. Theory Ser. B 16(1), 47\u201356 (1974)","journal-title":"J. Comb. Theory Ser. B"},{"key":"41_CR24","unstructured":"Heinz, M.: Tree-decomposition: graph minor theory and algorithmic implications. Master\u2019s thesis, Technischen Universit\u00e4t Wien (2013)"},{"issue":"1","key":"41_CR25","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1002\/jgt.20121","volume":"51","author":"F Fomin","year":"2006","unstructured":"Fomin, F., Thilikos, D.: New upper bounds on the decomposability of planar graphs. J. Graph Theory 51(1), 53\u201381 (2006)","journal-title":"J. Graph Theory"},{"key":"41_CR26","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1090\/S0894-0347-1990-1065053-0","volume":"3","author":"N Alon","year":"1990","unstructured":"Alon, N., Seymour, P., Thomas, R.: A separator theorem for nonplanar graphs. J. Am. Math. Soc. 3, 801\u2013808 (1990)","journal-title":"J. Am. Math. Soc."},{"key":"41_CR27","doi-asserted-by":"publisher","first-page":"56","DOI":"10.5614\/ejgta.2013.1.1.6","volume":"1","author":"A Shabbir","year":"2013","unstructured":"Shabbir, A., Zamfirescu, C., Zamfirescu, T.: Intersecting longest paths and longest cycles: a survey. Electron. J. Graph Theory Appl. 1, 56\u201376 (2013)","journal-title":"Electron. J. Graph Theory Appl."}],"container-title":["Lecture Notes in Computer Science","LATIN 2018: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-77404-6_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T18:30:00Z","timestamp":1751481000000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-77404-6_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319774039","9783319774046"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-77404-6_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"13 March 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATIN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Latin American Symposium on Theoretical Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Buenos Aires","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Argentina","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 April 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 April 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"latin2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/latin2018.dc.uba.ar\/#","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}