{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T21:10:38Z","timestamp":1770325838671,"version":"3.49.0"},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2009,12,1]],"date-time":"2009-12-01T00:00:00Z","timestamp":1259625600000},"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":[[2009,12]]},"DOI":"10.1007\/s00373-010-0881-5","type":"journal-article","created":{"date-parts":[[2010,2,9]],"date-time":"2010-02-09T05:25:12Z","timestamp":1265693112000},"page":"817-824","source":"Crossref","is-referenced-by-count":11,"title":["Packing and Covering Triangles in Planar Graphs"],"prefix":"10.1007","volume":"25","author":[{"given":"Qing","family":"Cui","sequence":"first","affiliation":[]},{"given":"Penny","family":"Haxell","sequence":"additional","affiliation":[]},{"given":"Will","family":"Ma","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,2,10]]},"reference":[{"key":"881_CR1","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/S0012-365X(98)00183-6","volume":"195","author":"P.E. Haxell","year":"1999","unstructured":"Haxell P.E.: Packing and covering triangles in graphs. Discrete Math. 195, 251\u2013254 (1999)","journal-title":"Discrete Math."},{"key":"881_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s003730050010","volume":"14","author":"P.E. Haxell","year":"1998","unstructured":"Haxell P.E., Kohayakawa Y.: Packing and covering triangles in tripartite graphs. Graphs Combin. 14, 1\u201310 (1998)","journal-title":"Graphs Combin."},{"key":"881_CR3","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":"881_CR4","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, p. 888. North-Holland, Amsterdam (1984)"},{"key":"881_CR5","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 Combin. 6, 373\u2013380 (1990)","journal-title":"Graphs Combin."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-010-0881-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-010-0881-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-010-0881-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T10:58:29Z","timestamp":1559041109000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-010-0881-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,12]]},"references-count":5,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2009,12]]}},"alternative-id":["881"],"URL":"https:\/\/doi.org\/10.1007\/s00373-010-0881-5","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,12]]}}}