{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T11:58:32Z","timestamp":1772366312219,"version":"3.50.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,4,17]],"date-time":"2011-04-17T00:00:00Z","timestamp":1302998400000},"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,5]]},"DOI":"10.1007\/s00373-011-1048-8","type":"journal-article","created":{"date-parts":[[2011,4,16]],"date-time":"2011-04-16T05:41:16Z","timestamp":1302932476000},"page":"381-392","source":"Crossref","is-referenced-by-count":15,"title":["Small Edge Sets Meeting all Triangles of a Graph"],"prefix":"10.1007","volume":"28","author":[{"given":"S.","family":"Aparna Lakshmanan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cs.","family":"Bujt\u00e1s","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zs.","family":"Tuza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,4,17]]},"reference":[{"key":"1048_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s004930170001","volume":"21","author":"R. Aharoni","year":"2001","unstructured":"Aharoni R.: Ryser\u2019s conjecture for tripartite 3-graphs. Combinatorica 21, 1\u20134 (2001)","journal-title":"Combinatorica"},{"key":"1048_CR2","unstructured":"Lakshmanan, S. Aparna, Bujt\u00e1s, Cs., Tuza, Zs.: manuscript in preparation"},{"key":"1048_CR3","doi-asserted-by":"crossref","first-page":"1509","DOI":"10.1155\/S0161171204310094","volume":"29","author":"J. Bagga","year":"2004","unstructured":"Bagga J.: Old and new generalizations of line graphs. Int. J. Math. Math. Sci 29, 1509\u20131521 (2004)","journal-title":"Int. J. Math. Math. Sci"},{"key":"1048_CR4","unstructured":"Chapuy, G., DeVos, M., McDonald, J., Mohar, B., Scheide, D.: Packing triangles in weighted graphs (2010)"},{"key":"1048_CR5","doi-asserted-by":"crossref","first-page":"51","DOI":"10.4007\/annals.2006.164.51","volume":"164","author":"M. Chudnovsky","year":"2006","unstructured":"Chudnovsky M., Robertson N., Seymour P., Thomas R.: The strong perfect graph theorem. Ann. Math. 164, 51\u2013229 (2006)","journal-title":"Ann. Math."},{"key":"1048_CR6","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 Combin. 25, 817\u2013824 (2009)","journal-title":"Graphs Combin."},{"key":"1048_CR7","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0012-365X(95)00178-Y","volume":"150","author":"P. Erd\u0151s","year":"1996","unstructured":"Erd\u0151s P., Gallai T., Tuza Zs.: Covering and independence in triangle structures. Discret. Math. 150, 89\u2013101 (1996)","journal-title":"Discret. Math."},{"key":"1048_CR8","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. Discret. Math. 195, 251\u2013254 (1999)","journal-title":"Discret. Math."},{"key":"1048_CR9","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":"1048_CR10","unstructured":"Haxell, P., Kostochka, A., Thomass\u00e9, S.: A stability theorem on fractional covering of triangles by edges (2010)"},{"key":"1048_CR11","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1137\/0210055","volume":"10","author":"I. Holyer","year":"1981","unstructured":"Holyer I.: The NP-completeness of edge-colouring. SIAM J. Comput. 10, 718\u2013720 (1981)","journal-title":"SIAM J. Comput."},{"key":"1048_CR12","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. Discret. Math. 142, 281\u2013286 (1995)","journal-title":"Discret. Math."},{"key":"1048_CR13","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0012-365X(95)00109-A","volume":"159","author":"V.B. Le","year":"1996","unstructured":"Le V.B.: Gallai graphs and anti-Gallai graphs. Discret. Math. 159, 179\u2013189 (1996)","journal-title":"Discret. Math."},{"key":"1048_CR14","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/s00373-008-0821-9","volume":"25","author":"T. Mansour","year":"2009","unstructured":"Mansour T., Song C., Yuster R.: A comment on Ryser\u2019s conjecture for intersecting hypergraphs. Graphs Combin. 25, 101\u2013109 (2009)","journal-title":"Graphs Combin."},{"key":"1048_CR15","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1007\/PL00021184","volume":"14","author":"E. Prisner","year":"1998","unstructured":"Prisner E.: Intersection multigraphs of uniform hypergraphs. Graphs Combin. 14, 363\u2013375 (1998)","journal-title":"Graphs Combin."},{"key":"1048_CR16","unstructured":"Tuza, Zs.: Conjecture, finite and infinite sets. In: Hajnal, A., Lov\u00e1sz, L., S\u00f3s, V.T. (eds.) Proc. Colloq. Math. Soc. J. Bolyai (Eger, Hungary, 1981), vol. 37, p. 888, North-Holland, Amsterdam (1984)"},{"key":"1048_CR17","first-page":"201","volume":"16B","author":"Zs. Tuza","year":"1983","unstructured":"Tuza Zs.: Ryser\u2019s conjecture on transversals of r-partite hypergraphs. Ars Combin. 16B, 201\u2013209 (1983)","journal-title":"Ars Combin."},{"key":"1048_CR18","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."},{"key":"1048_CR19","unstructured":"Tuza, Zs.: Some open problems on colorings and coverings of graphs (Abstract), Graphentheorie-Tagung Oberwolfach (1990)"},{"key":"1048_CR20","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1112\/blms\/26.4.321","volume":"26","author":"Zs. Tuza","year":"1994","unstructured":"Tuza Zs.: Perfect triangle families. Bull. Lond. Math. Soc. 26, 321\u2013324 (1994)","journal-title":"Bull. Lond. Math. Soc."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-011-1048-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-011-1048-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-011-1048-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,6]],"date-time":"2023-06-06T10:22:38Z","timestamp":1686046958000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-011-1048-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,4,17]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,5]]}},"alternative-id":["1048"],"URL":"https:\/\/doi.org\/10.1007\/s00373-011-1048-8","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,4,17]]}}}