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 Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

The deck of a graph $G$ is the multiset of cards $\{G-v:v\in V(G)\}$. Myrvold(1992) showed that the degree sequence of a graph on $n\geq7$ vertices can bereconstructed from any deck missing one card. We prove that the degree sequenceof a graph with average degree $d$ can reconstructed from any deck missing$O(n/d^3)$ cards. In particular, in the case of graphs that can be embedded ona fixed surface (e.g. planar graphs), the degree sequence can be reconstructedeven when a linear number of the cards are missing.

Reconstructing the degree sequence of a sparse graph from a partial deck