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 Tools annual

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 monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

Let $G$ be a graph on $n$ vertices. For $i\in \{0,1\}$ and a connected graph$G$, a spanning forest $F$ of $G$ is called an $i$-perfect forest if every treein $F$ is an induced subgraph of $G$ and exactly $i$ vertices of $F$ have evendegree (including zero). A $i$-perfect forest of $G$ is proper if it has novertices of degree zero. Scott (2001) showed that every connected graph witheven number of vertices contains a (proper) 0-perfect forest. We prove that onecan find a 0-perfect forest with minimum number of edges in polynomial time,but it is NP-hard to obtain a 0-perfect forest with maximum number of edges.Moreover, we show that to decide whether $G$ has a 0-perfect forest with atleast $|V(G)|/2+k$ edges, where $k$ is the parameter, is W[1]-hard. We alsoprove that for a prescribed edge $e$ of $G,$ it is NP-hard to obtain a0-perfect forest containing $e,$ but one can decide if there existsa 0-perfectforest not containing $e$ in polynomial time. It is easy to see that everygraph with odd number of vertices has a 1-perfect forest. It is not the casefor proper 1-perfect forests. We give a characterization of when a connectedgraph has a proper 1-perfect forest.

Perfect Forests in Graphs and Their Extensions