You're viewing this item in the new Europeana website. View this item in the original Europeana.

# Degree sequences of graphs containing a cycle with prescribed length

Let $r\ge 3$, $n\ge r$ and $\pi =(d_1,d_2,\ldots ,d_n)$ be a non-increasing sequence of nonnegative integers. If $\pi$ has a realization $G$ with vertex set $V(G)=\{v_1,v_2,\ldots ,v_n\}$ such that $d_G(v_i)=d_i$ for $i=1,2,\ldots , n$ and $v_1v_2\cdots v_rv_1$ is a cycle of length $r$ in $G$, then $\pi$ is said to be potentially $C_r''$-graphic. In this paper, we give a characterization for \$\p…