{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T16:39:07Z","timestamp":1740155947470,"version":"3.37.3"},"reference-count":5,"publisher":"World Scientific Pub Co Pte Ltd","issue":"04","funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11571044"],"award-info":[{"award-number":["11571044"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["No.11471052"],"award-info":[{"award-number":["No.11471052"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11401038"],"award-info":[{"award-number":["11401038"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"crossref","award":["2014RC0904"],"award-info":[{"award-number":["2014RC0904"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2017,8]]},"abstract":"<jats:p> A graph is called [Formula: see text]-equicoverable if every minimal [Formula: see text]-covering of it is also its minimum [Formula: see text]-covering. In this paper, we consider how to characterize a graph to be [Formula: see text]-equicoverable where [Formula: see text] is [Formula: see text]. We obtained necessary and sufficient conditions for a graph contains a cycle with length greater than 3 but not contains any 3-cycles. <\/jats:p>","DOI":"10.1142\/s1793830917500525","type":"journal-article","created":{"date-parts":[[2017,7,10]],"date-time":"2017-07-10T06:49:02Z","timestamp":1499669342000},"page":"1750052","source":"Crossref","is-referenced-by-count":0,"title":["P4-equicoverable graphs which contain cycles with length at least 4"],"prefix":"10.1142","volume":"09","author":[{"given":"Qirui","family":"Wang","sequence":"first","affiliation":[{"name":"School of Science, Beijing University of Posts and Telecommunications, 100876 Beijing, P. R. China"}]},{"given":"Tianping","family":"Shuai","sequence":"additional","affiliation":[{"name":"School of Science, Beijing University of Posts and Telecommunications, 100876 Beijing, P. R. China"}]},{"given":"Wenbao","family":"Ai","sequence":"additional","affiliation":[{"name":"School of Science, Beijing University of Posts and Telecommunications, 100876 Beijing, P. R. China"}]},{"given":"Jianhua","family":"Yuan","sequence":"additional","affiliation":[{"name":"School of Science, Beijing University of Posts and Telecommunications, 100876 Beijing, P. R. China"}]}],"member":"219","published-online":{"date-parts":[[2017,8,16]]},"reference":[{"issue":"1","key":"S1793830917500525BIB001","first-page":"35","volume":"46","author":"Hartnell B. L.","year":"2006","journal-title":"Bull. Inst. Combin. Appl."},{"key":"S1793830917500525BIB002","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2008.09.018"},{"key":"S1793830917500525BIB003","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(85)90161-X"},{"key":"S1793830917500525BIB004","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2006.11.028"},{"key":"S1793830917500525BIB005","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2007.08.020"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830917500525","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,23]],"date-time":"2019-09-23T05:46:35Z","timestamp":1569217595000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830917500525"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8]]},"references-count":5,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2017,8,16]]},"published-print":{"date-parts":[[2017,8]]}},"alternative-id":["10.1142\/S1793830917500525"],"URL":"https:\/\/doi.org\/10.1142\/s1793830917500525","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2017,8]]}}}