Luo, Rong On potentially \(C_ k\)-graphic sequences. (English) Zbl 1071.05520 Ars Comb. 64, 301-318 (2002). An \(n\)-term nonincreasing nonnegative integer sequence \(\pi = (d_1, d_2, \dots , d_n)\) is said to be graphic, if it is the degree sequence of a simple graph. Then such a graph \(G\) is called a realization of \(\pi \). In particular, let \(H\) be a graph. If a graphic sequence \(\pi \) has a realization \(G\) which contains \(H\) as its subgraph, then \(\pi \) is said to be potentially \(H\)-graphic. The paper studies potentially \(C_k\)-graphic sequences, where \(C_k\) is a circuit of length \(k\) and \(k \in \{3, 4, 5\}\). Reviewer: Bohdan Zelinka (Liberec) Cited in 10 Documents MSC: 05C07 Vertex degrees Keywords:degree sequence; graphic sequence; circuit PDFBibTeX XMLCite \textit{R. Luo}, Ars Comb. 64, 301--318 (2002; Zbl 1071.05520)