Forcibly unicyclic and bicyclic graphic sequences

Peiyi Duan, Yingzhi Tian

A sequence $D=(d_1,d_2,\dots ,d_n)$ of non-negative integers is called a graphic sequence if there is a simple graph with vertices $v_1,v_2,\dots ,v_n$ such that the degree of $v_i…