{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T19:13:03Z","timestamp":1777057983297,"version":"3.51.4"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","issue":"Graph Theory","license":[{"start":{"date-parts":[[2020,10,12]],"date-time":"2020-10-12T00:00:00Z","timestamp":1602460800000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"},{"start":{"date-parts":[[2020,10,12]],"date-time":"2020-10-12T00:00:00Z","timestamp":1602460800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"},{"start":{"date-parts":[[2020,10,12]],"date-time":"2020-10-12T00:00:00Z","timestamp":1602460800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"accepted":{"date-parts":[[2025,4,1]]},"abstract":"<jats:p>Lov{\\'a}sz showed that a matching covered graph $G$ has an ear decomposition starting with an arbitrary edge of $G$. Let $G$ be a graph which has a perfect matching. We call $G$ cycle-nice if for each even cycle $C$ of $G$, $G-V(C)$ has a perfect matching. If $G$ is a cycle-nice matching covered graph, then $G$ has ear decompositions starting with an arbitrary even cycle of $G$. In this paper, we characterize cycle-nice claw-free plane graphs. We show that the only cycle-nice simple 3-connected claw-free plane graphs are $K_4$, $W_5$ and $\\overline C_6$. Furthermore, every cycle-nice 2-connected claw-free plane graph can be obtained from a graph in the family ${\\cal F}$ by a sequence of three types of operations, where ${\\cal F}$ consists of even cycles, a diamond, $K_4$, and $\\overline C_6$.<\/jats:p><jats:p>Comment: 12 pages<\/jats:p>","DOI":"10.23638\/dmtcs-22-4-6","type":"journal-article","created":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T16:58:12Z","timestamp":1743699492000},"source":"Crossref","is-referenced-by-count":1,"title":["Even cycles and perfect matchings in claw-free plane graphs"],"prefix":"10.23638","volume":"vol. 22 no. 4","author":[{"given":"Shanshan","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiumei","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinjiang","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"25203","published-online":{"date-parts":[[2020,10,12]]},"container-title":["Discrete Mathematics &amp; Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/arxiv.org\/pdf\/2001.10674v3","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/arxiv.org\/pdf\/2001.10674v3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T16:58:12Z","timestamp":1743699492000},"score":1,"resource":{"primary":{"URL":"http:\/\/dmtcs.episciences.org\/6062"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,12]]},"references-count":0,"journal-issue":{"issue":"Graph Theory","published-online":{"date-parts":[[2020,10,12]]}},"URL":"https:\/\/doi.org\/10.23638\/dmtcs-22-4-6","relation":{"has-preprint":[{"id-type":"arxiv","id":"2001.10674v2","asserted-by":"subject"},{"id-type":"arxiv","id":"2001.10674v1","asserted-by":"subject"}],"is-same-as":[{"id-type":"arxiv","id":"2001.10674","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.2001.10674","asserted-by":"subject"}]},"ISSN":["1365-8050"],"issn-type":[{"value":"1365-8050","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,10,12]]},"article-number":"6062"}}