{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:43:59Z","timestamp":1753893839503,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>The following statement was conjectured by Faudree, Rousseau, Schelp and Schuster: if a graph $G$ is a non-star graph without cycles of length $m \\leq 4$ then $G$ is a subgraph of its complement. So far the best result concerning this conjecture is that every non-star graph $G$ without cycles of length $m \\leq 6$ is a subgraph of its complement. In this note we show that $m\\leq 6$ can be replaced by $m \\leq 5$.<\/jats:p>","DOI":"10.37236\/268","type":"journal-article","created":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T23:24:25Z","timestamp":1578698665000},"source":"Crossref","is-referenced-by-count":3,"title":["A Note on Packing Graphs Without Cycles of Length up to Five"],"prefix":"10.37236","volume":"16","author":[{"given":"Agnieszka","family":"G\u00f6rlich","sequence":"first","affiliation":[]},{"given":"Andrzej","family":"\u017bak","sequence":"additional","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2009,10,26]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v16i1n30\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v16i1n30\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T21:40:09Z","timestamp":1579297209000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v16i1n30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,10,26]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2009,1,7]]}},"URL":"https:\/\/doi.org\/10.37236\/268","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2009,10,26]]},"article-number":"N30"}}