{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T22:27:33Z","timestamp":1648852053760},"reference-count":4,"publisher":"World Scientific Pub Co Pte Lt","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2011,9]]},"abstract":"<jats:p> Let G be a k-connected (k \u2265 3), triangle-free graph with \u03b1(G) \u2264 k + 1. If G is not Petersen graph and G \u2209 {K<jats:sub>k, k<\/jats:sub>, K<jats:sub>k, k + 1<\/jats:sub>, K<jats:sub>k + 1, k+1<\/jats:sub>}, then G contains cycles of lengths from 4 to |V(G)|. This generalizes a result conjectured by Amar et al. (Graphs Combin.7 (1991)) and proved by Lou (Discrete Math.152 (1996)). <\/jats:p>","DOI":"10.1142\/s1793830911001267","type":"journal-article","created":{"date-parts":[[2011,10,21]],"date-time":"2011-10-21T08:29:23Z","timestamp":1319185763000},"page":"343-356","source":"Crossref","is-referenced-by-count":0,"title":["CYCLES IN TRIANGLE-FREE GRAPHS"],"prefix":"10.1142","volume":"03","author":[{"given":"XIAOJUAN","family":"LI","sequence":"first","affiliation":[{"name":"Urumqi Vocational University, Xinjiang 830002, P. R. China"}]},{"given":"BING","family":"WEI","sequence":"additional","affiliation":[{"name":"Department of Mathematics, The University of Mississippi, University, MS 38677, USA"}]},{"given":"YONGJIN","family":"ZHU","sequence":"additional","affiliation":[{"name":"Institute of Systems Science, The Chinese Academy of Sciences, Beijing 100080, P. R. China"}]}],"member":"219","published-online":{"date-parts":[[2012,4,5]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01788136"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-349-03521-2"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(72)90079-9"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(96)80461-4"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830911001267","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T12:12:53Z","timestamp":1565179973000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830911001267"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,9]]},"references-count":4,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2012,4,5]]},"published-print":{"date-parts":[[2011,9]]}},"alternative-id":["10.1142\/S1793830911001267"],"URL":"https:\/\/doi.org\/10.1142\/s1793830911001267","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,9]]}}}