{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T13:46:55Z","timestamp":1787320015394,"version":"build-2736575974"},"reference-count":13,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"1","funder":[{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Discrete Math."],"published-print":{"date-parts":[[2018,1]]},"abstract":"<jats:p>We prove that every connected graph $G$ with $m$ edges contains a set $X$ of at most $\\frac{3}{16}(m + 1)$ vertices such that $G-X$ has no $K_4$ minor, or, equivalently, has treewidth at most 2. This bound is best possible. Connectivity is essential: If $G$ is not connected, then only a bound of $\\frac{1}{5}m$ can be guaranteed.<\/jats:p>","DOI":"10.1137\/16m107712x","type":"journal-article","created":{"date-parts":[[2018,1,11]],"date-time":"2018-01-11T13:31:12Z","timestamp":1515677472000},"page":"123-147","source":"Crossref","is-referenced-by-count":0,"title":["$K_4$-Minor-Free Induced Subgraphs of Sparse Connected Graphs"],"prefix":"10.1137","volume":"32","author":[{"given":"Gwena\u00ebl","family":"Joret","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David R.","family":"Wood","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2018,1,11]]},"reference":[{"key":"atypb1","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00358"},{"key":"atypb2","doi-asserted-by":"crossref","unstructured":"R. Diestel,\n                      Graph Theory\n                      , 3rd ed., Grad. Texts in Math. 173, Springer-Verlag, Berlin, 2005.","DOI":"10.1007\/978-3-642-14279-6_7"},{"key":"atypb3","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2015.11.013"},{"key":"atypb4","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2007.05.007"},{"key":"atypb5","doi-asserted-by":"crossref","first-page":"25","DOI":"10.37236\/2378","volume":"19","author":"Edwards K.","year":"2012","journal-title":"Electron. J. Combin."},{"key":"atypb6","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-014-9883-7"},{"key":"atypb7","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2011.05.010"},{"key":"atypb8","first-page":"567","author":"Gaspers S.","year":"2015","journal-title":"Berlin"},{"key":"atypb9","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2014.01.010"},{"key":"atypb10","first-page":"385","author":"Kneis J.","year":"2005","journal-title":"Berlin"},{"key":"atypb11","doi-asserted-by":"publisher","DOI":"10.1137\/080715482"},{"key":"atypb12","doi-asserted-by":"crossref","unstructured":"A. D. Scott and G. B. Sorkin,\n                      Faster algorithms for MAX CUT and MAX CSP, with polynomial expected time for sparse instances\n                      , in Proceedings of the 7th International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM 2003), S. Arora, K. Jansen, J. D. P. Rolim, and A. Sahai, eds., Lecture Notes in Comput. Sci. 2764, Springer, Berlin, 2003, pp. 382-395,https:\/\/doi.org\/10.1007\/978-3-540-45198-3_32.","DOI":"10.1007\/978-3-540-45198-3_32"},{"key":"atypb13","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2007.08.001"}],"container-title":["SIAM Journal on Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/16M107712X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T12:53:43Z","timestamp":1787316823000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/16M107712X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["10.1137\/16M107712X"],"URL":"https:\/\/doi.org\/10.1137\/16m107712x","relation":{},"ISSN":["0895-4801","1095-7146"],"issn-type":[{"value":"0895-4801","type":"print"},{"value":"1095-7146","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,1]]}}}