{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T10:35:15Z","timestamp":1762252515326,"version":"build-2065373602"},"reference-count":23,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1016\/j.dam.2025.06.049","type":"journal-article","created":{"date-parts":[[2025,7,15]],"date-time":"2025-07-15T11:46:07Z","timestamp":1752579967000},"page":"225-233","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["On Tuza\u2019s conjecture in dense graphs"],"prefix":"10.1016","volume":"377","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4437-5085","authenticated-orcid":false,"given":"Luis","family":"Chahua","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1860-7383","authenticated-orcid":false,"given":"Juan","family":"Guti\u00e9rrez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.dam.2025.06.049_b1","series-title":"Graduate Texts in Mathematics","article-title":"Graph theory","author":"Bondy","year":"2008"},{"key":"10.1016\/j.dam.2025.06.049_b2","series-title":"Graduate texts in mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-14279-6","article-title":"Graph Theory","author":"Diestel","year":"2010"},{"key":"10.1016\/j.dam.2025.06.049_b3","first-page":"888","article-title":"Conjecture in: finite and infinite sets","volume":"vol. 37","author":"Tuza","year":"1981"},{"issue":"1","key":"10.1016\/j.dam.2025.06.049_b4","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/S0012-365X(98)00183-6","article-title":"Packing and covering triangles in graphs","volume":"195","author":"Haxell","year":"1999","journal-title":"Discrete Math."},{"issue":"4","key":"10.1016\/j.dam.2025.06.049_b5","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF01787705","article-title":"A conjecture on triangles of graphs","volume":"6","author":"Tuza","year":"1990","journal-title":"Graphs Combin."},{"issue":"6","key":"10.1016\/j.dam.2025.06.049_b6","doi-asserted-by":"crossref","first-page":"817","DOI":"10.1007\/s00373-010-0881-5","article-title":"Packing and covering triangles in planar graphs","volume":"25","author":"Cui","year":"2009","journal-title":"Graphs Combin."},{"issue":"5","key":"10.1016\/j.dam.2025.06.049_b7","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1007\/s00373-011-1071-9","article-title":"Packing and covering triangles in K4-free planar graphs","volume":"28","author":"Haxell","year":"2012","journal-title":"Graphs Combin."},{"issue":"4","key":"10.1016\/j.dam.2025.06.049_b8","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2020.112281","article-title":"On Tuza\u2019s conjecture for triangulations and graphs with small treewidth","volume":"344","author":"Botler","year":"2021","journal-title":"Discrete Math."},{"issue":"1","key":"10.1016\/j.dam.2025.06.049_b9","article-title":"Tuza\u2019s conjecture for threshold graphs","volume":"24","author":"Bonamy","year":"2022","journal-title":"Discrete Mathematics & Theoretical Computer Science"},{"issue":"1","key":"10.1016\/j.dam.2025.06.049_b10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s003730050010","article-title":"Packing and covering triangles in tripartite graphs","volume":"14","author":"Haxell","year":"1998","journal-title":"Graphs Combin."},{"year":"2016","series-title":"Matchings and Covers in Hypergraphs","author":"Szestopalow","key":"10.1016\/j.dam.2025.06.049_b11"},{"issue":"3","key":"10.1016\/j.dam.2025.06.049_b12","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/s00373-011-1048-8","article-title":"Small edge sets meeting all triangles of a graph","volume":"28","author":"Aparna\u00a0Lakshmanan","year":"2011","journal-title":"Graphs Combin."},{"key":"10.1016\/j.dam.2025.06.049_b13","first-page":"25","article-title":"On an estimate of the chromatic class of a p-graph","volume":"3","author":"Vizing","year":"1989","journal-title":"Diskret. Analiz."},{"key":"10.1016\/j.dam.2025.06.049_b14","first-page":"315","article-title":"Decompositions of graphs into complete subgraphs of given order","volume":"22","author":"Gy\u0151ri","year":"1987","journal-title":"Studia Sci. Math. Hungar."},{"key":"10.1016\/j.dam.2025.06.049_b15","series-title":"Electron. Colloquium Comput. Complex.","first-page":"13","article-title":"Packing edge-disjoint triangles in given graphs.","volume":"19","author":"Feder","year":"2012"},{"key":"10.1016\/j.dam.2025.06.049_b16","article-title":"Better bounds for max cut","volume":"10","author":"Bollob\u00e1s","year":"2002","journal-title":"Bolyai Soc. Math. Stud."},{"key":"10.1016\/j.dam.2025.06.049_b17","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1016\/j.ejc.2015.03.006","article-title":"Tuza\u2019s conjecture for graphs with maximum average degree less than 7","volume":"49","author":"Puleo","year":"2015","journal-title":"European J. Combin."},{"key":"10.1016\/j.dam.2025.06.049_b18","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1007\/BF01456961","article-title":"\u00dcber Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre","volume":"77","author":"K\u00f6nig","year":"1916","journal-title":"Math. Ann."},{"year":"1978","series-title":"Extremal graph theory","author":"Bollob\u00e1s","key":"10.1016\/j.dam.2025.06.049_b19"},{"issue":"4","key":"10.1016\/j.dam.2025.06.049_b20","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1002\/jgt.3190130411","article-title":"Lower bounds on the number of triangles in a graph","volume":"13","author":"Fisher","year":"1989","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.dam.2025.06.049_b21","article-title":"Extensions to 2-factors in bipartite graphs","volume":"20","author":"Vandenbussche","year":"2013","journal-title":"The Electronic Journal of Combinatorics [Electronic Only]"},{"issue":"17","key":"10.1016\/j.dam.2025.06.049_b22","doi-asserted-by":"crossref","first-page":"2593","DOI":"10.1016\/j.disc.2011.09.035","article-title":"Some criteria for a graph to be class 1","volume":"312","author":"Akbari","year":"2012","journal-title":"Discrete Math."},{"issue":"4","key":"10.1016\/j.dam.2025.06.049_b23","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1007\/s00373-018-1903-y","article-title":"Triangle packings and transversals of some K4 graphs","volume":"34","author":"Munaro","year":"2018","journal-title":"Graphs and Combinatorics"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X25003622?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X25003622?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T10:31:25Z","timestamp":1762252285000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X25003622"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12]]},"references-count":23,"alternative-id":["S0166218X25003622"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2025.06.049","relation":{},"ISSN":["0166-218X"],"issn-type":[{"type":"print","value":"0166-218X"}],"subject":[],"published":{"date-parts":[[2025,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On Tuza\u2019s conjecture in dense graphs","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2025.06.049","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}]}}