English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Lov{\'a}sz showed that a matching covered graph $G$ has an ear decompositionstarting with an arbitrary edge of $G$. Let $G$ be a graph which has a perfectmatching. 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 thispaper, we characterize cycle-nice claw-free plane graphs. We show that the onlycycle-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 planegraph can be obtained from a graph in the family ${\cal F}$ by a sequence ofthree types of operations, where ${\cal F}$ consists of even cycles, a diamond,$K_4$, and $\overline C_6$.

Even cycles and perfect matchings in claw-free plane graphs