Author

Songling Shan

2 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Sep 2026

Degree sequence condition for pancyclicity in tough graphs

Let $t \ge 1$ be an integer, and let $G$ be a $t$-tough $n$-vertex graph with degree sequence $d_1, d_2, \ldots, d_n$ in non-decreasing order. In 1995, Ho\`ang conjectured that if $G$ is Hamiltonian and, for every integer $i$ satisfying $t\le i<n/2$, $d_i\le i$, and $d_{n-i+t}<n-i$, one has $d_j + d_{n-j+t} \ge n$ for...

Songling Shan, Zachary Warren · 0 citations

Review Sep 2026

Long Cycles in 2-Connected Tough Graphs

Let $G$ be a graph. The circumference of $G$, denoted by $cir(G)$, is the length of a longest cycle in $G$, or zero if $G$ is acyclic. In 1993, Broersma, van den Heuvel, Jung, and Veldman conjectured that, for every $t>0$, there is a constant $A=A(t)>0$ such that every 2-connected $t$-tough graph of order $n$ has circu...

Songling Shan · 1 citation