{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T14:45:10Z","timestamp":1787323510212,"version":"build-2736575974"},"reference-count":10,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Discrete Math."],"published-print":{"date-parts":[[2021,1]]},"abstract":"<jats:p>We show that connected graphs admit sublinear longest path transversals. This improves an earlier result of Rautenbach and Sereni and is related to the fifty-year-old question of whether connected graphs admit longest path transversals of constant size. The same technique allows us to show that 2-connected graphs admit sublinear longest cycle transversals.<\/jats:p>","DOI":"10.1137\/20m1362577","type":"journal-article","created":{"date-parts":[[2021,7,27]],"date-time":"2021-07-27T11:11:40Z","timestamp":1627384300000},"page":"1673-1677","source":"Crossref","is-referenced-by-count":4,"title":["Sublinear Longest Path Transversals"],"prefix":"10.1137","volume":"35","author":[{"suffix":"Jr.","given":"James A.","family":"Long","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9680-8949","authenticated-orcid":true,"given":"Kevin G.","family":"Milans","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1509-8832","authenticated-orcid":true,"given":"Andrea","family":"Munaro","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2021,7,27]]},"reference":[{"key":"atypb1","doi-asserted-by":"crossref","unstructured":"R. Diestel,\n                      Graph Theory\n                      , Grad. Texts in Math. 173, Springer, 2005.","DOI":"10.1007\/978-3-642-14279-6_7"},{"key":"atypb2","unstructured":"T. Gallai,\n                      Problem 4\n                      , in Theory of Graphs, Proceedings of the Colloquium Held at Tihany, Hungary, 1966, P. Erd\u00f6s and G. Katona, eds., Academic Press, 1968, p. 362."},{"key":"atypb3","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(74)90025-9"},{"key":"atypb4","doi-asserted-by":"publisher","DOI":"10.1137\/130910658"},{"key":"atypb5","first-page":"557","author":"Thomassen C.","year":"1978","journal-title":"Springer"},{"key":"atypb6","doi-asserted-by":"publisher","DOI":"10.1016\/S0021-9800(69)80098-0"},{"key":"atypb7","unstructured":"H. Walther and H.J. Voss,\n                      \u00dcber Kreise in Graphen\n                      , Deutscher Verlag der Wissenschaften, 1974."},{"key":"atypb8","unstructured":"D. B. West,\n                      Introduction to Graph Theory\n                      , 2nd ed., Prentice Hall, 2001."},{"key":"atypb9","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(72)90048-2"},{"key":"atypb10","doi-asserted-by":"publisher","DOI":"10.7146\/math.scand.a-11630"}],"container-title":["SIAM Journal on Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/20M1362577","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T14:06:43Z","timestamp":1787321203000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/20M1362577"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["10.1137\/20M1362577"],"URL":"https:\/\/doi.org\/10.1137\/20m1362577","relation":{},"ISSN":["0895-4801","1095-7146"],"issn-type":[{"value":"0895-4801","type":"print"},{"value":"1095-7146","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1]]}}}