{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T06:18:48Z","timestamp":1725862728435},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319445427"},{"type":"electronic","value":"9783319445434"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-44543-4_21","type":"book-chapter","created":{"date-parts":[[2016,8,8]],"date-time":"2016-08-08T11:49:58Z","timestamp":1470656998000},"page":"266-277","source":"Crossref","is-referenced-by-count":6,"title":["Sufficient Conditions for Tuza\u2019s Conjecture on Packing and Covering Triangles"],"prefix":"10.1007","author":[{"given":"Xujin","family":"Chen","sequence":"first","affiliation":[]},{"given":"Zhuo","family":"Diao","sequence":"additional","affiliation":[]},{"given":"Xiaodong","family":"Hu","sequence":"additional","affiliation":[]},{"given":"Zhongzheng","family":"Tang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,8,9]]},"reference":[{"key":"21_CR1","unstructured":"Baron, J.D., Kahn, J.: Tuza\u2019s conjecture is asymptotically tight for dense graphs. arXiv preprint (2014). arXiv:1408.4870"},{"key":"21_CR2","volume-title":"Hypergraphs: Combinatorics of Finite Sets","author":"C Berge","year":"1989","unstructured":"Berge, C.: Hypergraphs: Combinatorics of Finite Sets. Elsevier, New York (1989)"},{"issue":"1","key":"21_CR3","doi-asserted-by":"crossref","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."},{"key":"21_CR4","unstructured":"Chen, X., Diao, Z., Hu, X., Tang, Z.: Sufficient conditions for tuza\u2019s conjecture on packing and covering triangles. arXiv preprint (2016). arXiv:1605.01816"},{"issue":"6","key":"21_CR5","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., Ma, W.: Packing and covering triangles in planar graphs. Graphs Comb. 25(6), 817\u2013824 (2009)","journal-title":"Graphs Comb."},{"issue":"5","key":"21_CR6","doi-asserted-by":"crossref","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","key":"21_CR7","doi-asserted-by":"crossref","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), 251\u2013254 (1999)","journal-title":"Discrete Math."},{"issue":"1","key":"21_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s003730050010","volume":"14","author":"PE Haxell","year":"1998","unstructured":"Haxell, P.E., Kohayakawa, Y.: Packing and covering triangles in tripartite graphs. Graphs Comb. 14(1), 1\u201310 (1998)","journal-title":"Graphs Comb."},{"issue":"1","key":"21_CR9","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(1), 281\u2013286 (1995)","journal-title":"Discrete Math."},{"key":"21_CR10","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency","author":"A Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer Science & Business Media, Heidelberg (2003)"},{"key":"21_CR11","unstructured":"Tuza, Z.: Conjecture in: finite and infinite sets. In: Proceedings of Colloque Mathematical Society Jnos Bolyai, Eger, Hungary, North-Holland, p. 888 (1981)"},{"issue":"4","key":"21_CR12","doi-asserted-by":"crossref","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":"2","key":"21_CR13","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1287\/moor.10.2.280","volume":"10","author":"M Yannakakis","year":"1985","unstructured":"Yannakakis, M.: On a class of totally unimodular matrices. Math. Oper. Res. 10(2), 280\u2013304 (1985)","journal-title":"Math. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-44543-4_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T20:11:13Z","timestamp":1498335073000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-44543-4_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319445427","9783319445434"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-44543-4_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}