{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T11:58:33Z","timestamp":1772366313093,"version":"3.50.1"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T00:00:00Z","timestamp":1586563200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T00:00:00Z","timestamp":1586563200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-1600551"],"award-info":[{"award-number":["DMS-1600551"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2020,7]]},"DOI":"10.1007\/s00373-020-02167-8","type":"journal-article","created":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T11:05:25Z","timestamp":1586603125000},"page":"1059-1063","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Packing and Covering Directed Triangles"],"prefix":"10.1007","volume":"36","author":[{"given":"Jessica","family":"McDonald","sequence":"first","affiliation":[]},{"given":"Gregory J.","family":"Puleo","sequence":"additional","affiliation":[]},{"given":"Craig","family":"Tennenhouse","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,4,11]]},"reference":[{"issue":"5","key":"2167_CR1","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1017\/S0963548316000067","volume":"25","author":"JD Baron","year":"2016","unstructured":"Baron, J.D., Kahn, J.: Tuza\u2019s conjecture is asymptotically tight for dense graphs. Comb. Probab. Comput. 25(5), 645\u2013667 (2016)","journal-title":"Comb. Probab. Comput."},{"issue":"1","key":"2167_CR2","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1137\/100803869","volume":"28","author":"G Chapuy","year":"2014","unstructured":"Chapuy, G., DeVos, M., McDonald, J., Mohar, B., Scheide, D.: Packing triangles in weighted graphs. SIAM J. Discrete Math. 28(1), 226\u2013239 (2014)","journal-title":"SIAM J. Discrete Math."},{"issue":"1\u20133","key":"2167_CR3","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0012-365X(98)00183-6","volume":"195","author":"PE Haxell","year":"1999","unstructured":"Haxell, P.E.: Packing and covering triangles in graphs. Discrete Math. 195(1\u20133), 251\u2013254 (1999)","journal-title":"Discrete Math."},{"issue":"1","key":"2167_CR4","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/s004930170003","volume":"21","author":"PE Haxell","year":"2001","unstructured":"Haxell, P.E., R\u00f6dl, V.: Integer and fractional packings in dense graphs. Combinatorica 21(1), 13\u201338 (2001)","journal-title":"Combinatorica"},{"issue":"5","key":"2167_CR5","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1007\/s00373-011-1071-9","volume":"28","author":"P Haxell","year":"2012","unstructured":"Haxell, P., Kostochka, A., Thomass\u00e9, S.: Packing and covering triangles in $$K_4$$-free planar graphs. Graphs Comb. 28(5), 653\u2013662 (2012)","journal-title":"Graphs Comb."},{"issue":"1\u20133","key":"2167_CR6","doi-asserted-by":"publisher","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(1\u20133), 281\u2013286 (1995)","journal-title":"Discrete Math."},{"issue":"3","key":"2167_CR7","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/s00373-011-1048-8","volume":"28","author":"SA Lakshmanan","year":"2012","unstructured":"Lakshmanan, S.A., Bujt\u00e1s, Cs., Tuza, Zs.: Small edge sets meeting all triangles of a graph. Graphs Comb. 28(3), 381\u2013392 (2012)","journal-title":"Graphs Comb."},{"key":"2167_CR8","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/j.ejc.2015.03.006","volume":"49","author":"GJ Puleo","year":"2015","unstructured":"Puleo, G.J.: Tuza\u2019s conjecture for graphs with maximum average degree less than 7. Eur. J. Comb. 49, 134\u2013152 (2015)","journal-title":"Eur. J. Comb."},{"key":"2167_CR9","unstructured":"Tuza, Z.: Finite and infinite sets. Vol. I, II, Proceedings of the sixth Hungarian combinatorial colloquium held in Eger, July 6\u201311, 1981 (Amsterdam) (A.\u00a0Hajnal, L.\u00a0Lov\u00e1sz, and V.\u00a0T. S\u00f3s, eds.), Colloquia Mathematica Societatis J\u00e1nos Bolyai, vol.\u00a037, North-Holland Publishing Co., p.\u00a0888 (1984)"},{"issue":"4","key":"2167_CR10","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/BF01787705","volume":"6","author":"Z Tuza","year":"1990","unstructured":"Tuza, Z.: A conjecture on triangles of graphs. Graphs Comb. 6(4), 373\u2013380 (1990)","journal-title":"Graphs Comb."},{"issue":"4","key":"2167_CR11","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1112\/blms\/26.4.321","volume":"26","author":"Z Tuza","year":"1994","unstructured":"Tuza, Z.: Perfect triangle families. Bull. Lond. Math. Soc. 26(4), 321\u2013324 (1994)","journal-title":"Bull. Lond. Math. Soc."},{"issue":"6","key":"2167_CR12","doi-asserted-by":"publisher","first-page":"952","DOI":"10.1017\/S0963548312000235","volume":"21","author":"R Yuster","year":"2012","unstructured":"Yuster, R.: Dense graphs with a large triangle cover have a large triangle packing. Comb. Probab. Comput. 21(6), 952\u2013962 (2012)","journal-title":"Comb. Probab. Comput."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-020-02167-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-020-02167-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-020-02167-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,10]],"date-time":"2021-04-10T23:10:46Z","timestamp":1618096246000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-020-02167-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4,11]]},"references-count":12,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,7]]}},"alternative-id":["2167"],"URL":"https:\/\/doi.org\/10.1007\/s00373-020-02167-8","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,4,11]]},"assertion":[{"value":"5 September 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 September 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 April 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}