{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T00:06:27Z","timestamp":1767139587046,"version":"build-2238731810"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T00:00:00Z","timestamp":1729555200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T00:00:00Z","timestamp":1729555200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100004489","name":"Mitacs","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004489","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Irving K. Barber Endowment Fund"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1007\/s00373-024-02845-x","type":"journal-article","created":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T12:02:52Z","timestamp":1729598572000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Packing and Covering Triangles in Bilaterally-Complete Tripartite Graphs"],"prefix":"10.1007","volume":"40","author":[{"given":"Naivedya","family":"Amarnani","sequence":"first","affiliation":[]},{"given":"A","family":"De Burgos","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8288-9645","authenticated-orcid":false,"given":"Wayne","family":"Broughton","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,10,22]]},"reference":[{"issue":"1","key":"2845_CR1","first-page":"71","volume":"3","author":"Mao Cheng Cai","year":"1983","unstructured":"Cai, Mao Cheng: Edge-disjoint Matchings in a Bipartite Graph. (Chinese) J. Systems Sci. Math. Sci. 3(1), 71\u201373 (1983)","journal-title":"(Chinese) J. Systems Sci. Math. Sci."},{"key":"2845_CR2","unstructured":"De Sousa, J.: Disjoint Common Transversals. In: Bose, R. C., Dowling, T. A. Combinatorial Mathematics and its Applications, pp. 87\u201394. Academic Press, London (1971)"},{"issue":"1","key":"2845_CR3","doi-asserted-by":"publisher","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 Combin. 14(1), 1\u201310 (1998)","journal-title":"Graphs Combin."},{"key":"2845_CR4","first-page":"104","volume":"34","author":"D\u00e9nes K\u00f6nig","year":"1916","unstructured":"K\u00f6nig, D\u00e9nes.: Graphok \u00e9s alkalmaz\u00e1suk a determin\u00e1nsok \u00e9s a halmazok elm\u00e9let\u00e9re. Mathematikai \u00c9s Term\u00e9szettudom\u00e1nyi \u00c9rtesit\u00f6. 34, 104\u2013119 (1916)","journal-title":"Mathematikai \u00c9s Term\u00e9szettudom\u00e1nyi \u00c9rtesit\u00f6."},{"issue":"3","key":"2845_CR5","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 Combin. 28(3), 381\u2013392 (2012)","journal-title":"Graphs Combin."},{"key":"2845_CR6","doi-asserted-by":"publisher","first-page":"96","DOI":"10.4064\/fm-10-1-96-115","volume":"10","author":"K Menger","year":"1927","unstructured":"Menger, K.: Zur Allgemeinen Kurventheorie. Fund. Math. 10, 96\u2013115 (1927)","journal-title":"Fund. Math."},{"key":"2845_CR7","doi-asserted-by":"crossref","unstructured":"Ore, O.: Theory of Graphs. American Mathematical Society Colloquium Publications, vol. 38. American Mathematical Society, Providence, RI (1962)","DOI":"10.1090\/coll\/038"},{"key":"2845_CR8","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/0022-247X(68)90163-7","volume":"22","author":"H Perfect","year":"1968","unstructured":"Perfect, H.: Applications of Menger\u2019s Graph Theorem. J. Math. Anal. Appl. 22, 96\u2013111 (1968)","journal-title":"J. Math. Anal. Appl."},{"key":"2845_CR9","unstructured":"Rao, Y.: Maximum Packings in Tripartite Graphs. Master\u2019s thesis, University of British Columbia (2017)"},{"key":"2845_CR10","unstructured":"Tuza, Zs.: Conjecture in: finite and infinite sets. In: Proc. Colloq. Math. Soc. J. Bolyai (Eger, Hungary, 1981), vol. 37, p.888. North-Holland, Amsterdam (1984)"},{"key":"2845_CR11","volume-title":"Introduction to Graph Theory","author":"DB West","year":"1996","unstructured":"West, D.B.: Introduction to Graph Theory. Prentice Hall, Upper Saddle River (1996)"}],"updated-by":[{"DOI":"10.1007\/s00373-024-02870-w","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2024,12,30]],"date-time":"2024-12-30T00:00:00Z","timestamp":1735516800000}}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-024-02845-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-024-02845-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-024-02845-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,30]],"date-time":"2024-12-30T16:07:09Z","timestamp":1735574829000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-024-02845-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,22]]},"references-count":11,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["2845"],"URL":"https:\/\/doi.org\/10.1007\/s00373-024-02845-x","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,10,22]]},"assertion":[{"value":"20 July 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 August 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 October 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 October 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 December 2024","order":5,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Correction","order":6,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"A Correction to this paper has been published:","order":7,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"https:\/\/doi.org\/10.1007\/s00373-024-02870-w","URL":"https:\/\/doi.org\/10.1007\/s00373-024-02870-w","order":8,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no Conflict of interest. The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}],"article-number":"112"}}