{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T20:37:20Z","timestamp":1770323840955,"version":"3.49.0"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2011,8,11]],"date-time":"2011-08-11T00:00:00Z","timestamp":1313020800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2012,9]]},"DOI":"10.1007\/s00373-011-1071-9","type":"journal-article","created":{"date-parts":[[2011,8,10]],"date-time":"2011-08-10T09:21:50Z","timestamp":1312968110000},"page":"653-662","source":"Crossref","is-referenced-by-count":18,"title":["Packing and Covering Triangles in K 4-free Planar Graphs"],"prefix":"10.1007","volume":"28","author":[{"given":"Penny","family":"Haxell","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexandr","family":"Kostochka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"St\u00e9phan","family":"Thomass\u00e9","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,8,11]]},"reference":[{"key":"1071_CR1","doi-asserted-by":"crossref","unstructured":"Aparna Lakshmanan, S., Bujt\u00e1s, Cs., Tuza, Zs.: Small edge sets meeting all triangles of a graph (2011, submitted)","DOI":"10.1007\/s00373-011-1048-8"},{"key":"1071_CR2","unstructured":"Chapuy, G., DeVos, M., McDonald, J., Mohar, B. Scheide, D.: Packing triangles in weighted graphs (2011, submitted)"},{"key":"1071_CR3","doi-asserted-by":"crossref","first-page":"817","DOI":"10.1007\/s00373-010-0881-5","volume":"25","author":"Q. Cui","year":"2009","unstructured":"Cui Q., Haxell P. E., Ma W.: Packing and covering triangles in planar graphs. Graphs Comb. 25, 817\u2013824 (2009)","journal-title":"Graphs Comb."},{"key":"1071_CR4","first-page":"269","volume":"21","author":"S. Fajtlowicz","year":"1978","unstructured":"Fajtlowicz S.: On the size of independent sets in graphs. Congr. Numer. 21, 269\u2013274 (1978)","journal-title":"Congr. Numer."},{"key":"1071_CR5","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/S0012-365X(98)00183-6","volume":"195","author":"P. Haxell","year":"1999","unstructured":"Haxell P.: Packing and covering triangles in graphs. Discret. Math. 195, 251\u2013254 (1999)","journal-title":"Discret. Math."},{"key":"1071_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s003730050010","volume":"14","author":"P. Haxell","year":"1998","unstructured":"Haxell P., Kohayakawa Y.: Packing and covering triangles in tripartite graphs. Graphs Comb. 14, 1\u201310 (1998)","journal-title":"Graphs Comb."},{"key":"1071_CR7","doi-asserted-by":"crossref","unstructured":"Haxell, P., Kostochka, A., Thomass\u00e9, S.: A stability theorem on fractional covering of triangles by edges. Eur. J. Comb. (2011, in press)","DOI":"10.1016\/j.ejc.2011.09.024"},{"key":"1071_CR8","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0012-365X(93)00228-W","volume":"142","author":"M. Krivelevich","year":"1995","unstructured":"Krivelevich M.: On a conjecture of Tuza about packing and covering of triangles. Discrete Math 142, 281\u2013286 (1995)","journal-title":"Discrete Math"},{"key":"1071_CR9","unstructured":"McKay, B.: Combinatorial data. http:\/\/cs.anu.edu.au\/people\/bdm\/data\/"},{"key":"1071_CR10","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1090\/S0002-9947-1979-0546922-6","volume":"256","author":"W. Stanton","year":"1979","unstructured":"Stanton W.: Some Ramsey-type numbers and the independence ratio. Trans. Am. Math. Soc. 256, 353\u2013370 (1979)","journal-title":"Trans. Am. Math. Soc."},{"key":"1071_CR11","first-page":"888","volume-title":"Proc. Colloq. Math. Soc. J. Bolyai vol. 37","author":"Zs. Tuza","year":"1984","unstructured":"Tuza Zs.: Conjecture, finite and infinite sets, Eger, Hungary 1981. In: Hajnal, A., Lov\u00e1sz, L., S\u00f3s, V.T. (eds) Proc. Colloq. Math. Soc. J. Bolyai vol. 37., pp. 888. North-Holland, Amsterdam (1984)"},{"key":"1071_CR12","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF01787705","volume":"6","author":"Zs. Tuza","year":"1990","unstructured":"Tuza Zs.: A conjecture on triangles of graphs. Graphs Comb. 6, 373\u2013380 (1990)","journal-title":"Graphs Comb."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-011-1071-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-011-1071-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-011-1071-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,13]],"date-time":"2019-06-13T23:39:52Z","timestamp":1560469192000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-011-1071-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,8,11]]},"references-count":12,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2012,9]]}},"alternative-id":["1071"],"URL":"https:\/\/doi.org\/10.1007\/s00373-011-1071-9","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,8,11]]}}}