05902601

j

05902601 Yin, Meng-Xiao Yin, Jian-Hua Wang, Ye Zhong, Cheng A characterization for a graphic sequence to be potentially $K_{2,s}$-graphic. Util. Math. 82, 25-31 (2010). 2010 University of Natal, Department of Mathematics and Applied Mathematics, Durban EN potentially $K_{2,s}$-graphic sequences degree sequence Zbl 0103.39701 Zbl 0483.05038 Summary: A non-increasing sequence $\pi= (d_1,d_2,\dots, d_n)$ of nonnegative integers is said to be potentially $K_{r,s}$-graphic if it is realizable by a graph on $n$ vertices containing $K_{r,s}$ as a subgraph, where $K_{r,s}$ is the $r\times s$ complete bipartite graph. We characterize the potentially $K_{2,s}$-graphic sequences. This characterization partially answers one problem due to {\it J. S. Li} and {\it J. H. Yin} [Adv. Math., Beijing 33, No.\,3, 273--283 (2004)].