{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:52:18Z","timestamp":1753894338282,"version":"3.41.2"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","issue":"Graph and Algorithms","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>Graphs and Algorithms<\/jats:p>\n          <jats:p xml:lang=\"en\">A 2-packing of a hypergraph H is a permutation sigma on V (H) such that if an edge e belongs to epsilon(H), then sigma(e) does not belong to epsilon(H). Let H be a hypergraph of order n which contains edges of cardinality at least 2 and at most n - 2. We prove that if H has at most n - 2 edges then it is 2-packable.<\/jats:p>","DOI":"10.46298\/dmtcs.537","type":"journal-article","created":{"date-parts":[[2021,8,23]],"date-time":"2021-08-23T21:48:07Z","timestamp":1629755287000},"source":"Crossref","is-referenced-by-count":0,"title":["On packing of two copies of a hypergraph"],"prefix":"10.46298","volume":"Vol. 13 no. 3","author":[{"given":"Monika","family":"Pilsniak","sequence":"first","affiliation":[{"name":"AGH University of Science and Technology [Krakow, PL]"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mariusz","family":"Wo\u017aniaK","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"25203","published-online":{"date-parts":[[2011,12,9]]},"container-title":["Discrete Mathematics &amp; Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/dmtcs.episciences.org\/537\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/dmtcs.episciences.org\/537\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T20:09:06Z","timestamp":1687291746000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/dmtcs.episciences.org\/537"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,12,9]]},"references-count":0,"journal-issue":{"issue":"Graph and Algorithms","published-online":{"date-parts":[[2011,12,9]]}},"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.46298\/dmtcs.537","relation":{"is-same-as":[{"id-type":"uri","id":"https:\/\/2.zoppoz.workers.dev:443\/https\/hal.science\/hal-00990481v1","asserted-by":"subject"}]},"ISSN":["1365-8050"],"issn-type":[{"type":"electronic","value":"1365-8050"}],"subject":[],"published":{"date-parts":[[2011,12,9]]},"article-number":"537"}}