{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T04:04:11Z","timestamp":1747541051115,"version":"3.40.5"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031929311","type":"print"},{"value":"9783031929328","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-92932-8_20","type":"book-chapter","created":{"date-parts":[[2025,5,17]],"date-time":"2025-05-17T07:47:30Z","timestamp":1747468050000},"page":"310-325","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Longest Path Transversals in\u00a0Claw-Free and\u00a0$$P_5$$-Free Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9304-4536","authenticated-orcid":false,"given":"Paloma T.","family":"Lima","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-1446-1935","authenticated-orcid":false,"given":"Amir","family":"Nikabadi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,5,18]]},"reference":[{"issue":"1\u20133","key":"20_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0012-365X(01)00268-0","volume":"250","author":"C Arbib","year":"2002","unstructured":"Arbib, C., Mosca, R.: On $$(P_5, \\text{ diamond})$$-free graphs. Discret. Math. 250(1\u20133), 1\u201322 (2002)","journal-title":"Discret. Math."},{"issue":"4","key":"20_CR2","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/BF02352694","volume":"21","author":"G Bacs\u00f3","year":"1990","unstructured":"Bacs\u00f3, G., Tuza, Z.: Dominating cliques in $$P_5$$-free graphs. Period. Math. Hung. 21(4), 303\u2013308 (1990)","journal-title":"Period. Math. Hung."},{"issue":"3","key":"20_CR3","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1017\/S0963548304006145","volume":"13","author":"PN Balister","year":"2004","unstructured":"Balister, P.N., Gy\u0151ri, E., Lehel, J., Schelp, R.H.: Longest paths in circular arc graphs. Combin. Probab. Comput. 13(3), 311\u2013317 (2004)","journal-title":"Combin. Probab. Comput."},{"key":"20_CR4","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.dam.2019.03.022","volume":"281","author":"MR Cerioli","year":"2020","unstructured":"Cerioli, M.R., Lima, P.T.: Intersection of longest paths in graph classes. Discret. Appl. Math. 281, 96\u2013105 (2020)","journal-title":"Discret. Appl. Math."},{"key":"20_CR5","first-page":"21","volume":"79","author":"MR Cerioli","year":"2006","unstructured":"Cerioli, M.R., Szwarcfiter, J.L.: Characterizing intersection graphs af substars of a star. Ars Combin. 79, 21\u201331 (2006)","journal-title":"Ars Combin."},{"issue":"3","key":"20_CR6","doi-asserted-by":"publisher","first-page":"111717","DOI":"10.1016\/j.disc.2019.111717","volume":"343","author":"MR Cerioli","year":"2020","unstructured":"Cerioli, M.R., Fernandes, C.G., G\u00f3mez, R., Guti\u00e9rrez, J., Lima, P.T.: Transversals of longest paths. Discret. Math. 343(3), 111717 (2020). https:\/\/doi.org\/10.1016\/j.disc.2019.111717","journal-title":"Discret. Math."},{"key":"20_CR7","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 small matching number. Czechoslov. Math. J. 65, 545\u2013553 (2015)","journal-title":"Czechoslov. Math. J."},{"issue":"3","key":"20_CR8","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., et al.: Nonempty intersection of longest paths in series-parallel graphs. Discret. Math. 340(3), 287\u2013304 (2017)","journal-title":"Discret. Math."},{"issue":"6","key":"20_CR9","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1016\/j.dam.2009.12.009","volume":"158","author":"SA Choudum","year":"2010","unstructured":"Choudum, S.A., Karthick, T.: First-fit coloring of $$\\{P_5, K_{4}-e\\}$$-free graphs. Discret. Appl. Math. 158(6), 620\u2013626 (2010)","journal-title":"Discret. Appl. Math."},{"key":"20_CR10","unstructured":"Erd\u0151s, P., Katona, G. (eds.): Theory of Graphs. Proceedings of the Colloquium held at Tihany, Hungary, September 1966, Academic Press, New York (1968). problem 4 (T. Gallai), p. 362"},{"key":"20_CR11","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/j.dam.2021.07.029","volume":"304","author":"Y Gao","year":"2021","unstructured":"Gao, Y., Shan, S.: Nonempty intersection of longest paths in graphs without forbidden pairs. Discret. Appl. Math. 304, 76\u201383 (2021)","journal-title":"Discret. Appl. Math."},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Golan, G., Shan, S.: Non-empty intersection of longest paths in $$2K_2$$-free graphs. Electr. J. Comb. 25, P2.37 (2018)","DOI":"10.37236\/7487"},{"key":"20_CR13","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.dam.2016.02.002","volume":"206","author":"AS Jobson","year":"2016","unstructured":"Jobson, A.S., K\u00e9zdy, A.E., Lehel, J., White, S.C.: Detour trees. Discret. Appl. Math. 206, 73\u201380 (2016)","journal-title":"Discret. Appl. Math."},{"issue":"3","key":"20_CR14","doi-asserted-by":"publisher","first-page":"419","DOI":"10.7151\/dmgt.1800","volume":"35","author":"F Joos","year":"2015","unstructured":"Joos, F.: A note on longest paths in circular arc graphs. Discussiones Mathematicae Graph Theory 35(3), 419\u2013426 (2015)","journal-title":"Discussiones Mathematicae Graph Theory"},{"issue":"3","key":"20_CR15","doi-asserted-by":"publisher","first-page":"1673","DOI":"10.1137\/20M1362577","volume":"35","author":"JA Long","year":"2021","unstructured":"Long, J.A., Milans, K.G., Munaro, A.: Sublinear longest path transversals. SIAM J. Discret. Math. 35(3), 1673\u20131677 (2021). https:\/\/doi.org\/10.1137\/20M1362577","journal-title":"SIAM J. Discret. Math."},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"Long\u00a0Jr, J.A., Milans, K.G., Munaro, A.: Non-empty intersection of longest paths in $$H $$-free graphs. Electr. J. Comb., p. P1.32 (2023)","DOI":"10.37236\/11277"},{"issue":"1","key":"20_CR17","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0020-0190(88)90143-3","volume":"28","author":"S Olariu","year":"1988","unstructured":"Olariu, S.: Paw-fee graphs. Inf. Process. Lett. 28(1), 53\u201354 (1988)","journal-title":"Inf. Process. Lett."},{"key":"20_CR18","unstructured":"Sumner, D.P.: Subtrees of a graph and chromatic number. In: Chartrand, G. (ed.) The Theory and Applications of Graphs. John Wiley & Sons, New York 557, 576 (1981)"},{"key":"20_CR19","unstructured":"Voss, H.J., Walther, H.: \u00dcber Kreise in Graphen. VEB Deutscher Verlag der Wissenschaften (1974)"},{"issue":"1","key":"20_CR20","doi-asserted-by":"publisher","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\u00e4ngsten wege eines graphen gehen. J. Comb. Theory 6(1), 1\u20136 (1969)","journal-title":"J. Comb. Theory"},{"issue":"2","key":"20_CR21","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."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-92932-8_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,17]],"date-time":"2025-05-17T07:47:33Z","timestamp":1747468053000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-92932-8_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031929311","9783031929328"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-92932-8_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"18 May 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rome","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 June 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ciac2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/easyconferences.eu\/ciac2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}