Publication:4242917

DOI<63::AID-JGT2>3.0.CO;2-A 10.1002/(SICI)1097-0118(199810)29:2<63::AID-JGT2>3.0.CO;2-AzbMath0919.05058MaRDI QIDQ4242917

Zi-Xia Song, Jiong-Sheng Li

Publication date: 11 May 1999

zbMATH Keywords

graphical sequence

Mathematics Subject Classification ID

05C99: Graph theory

Related Items

Graphic sequences with a realization containing intersecting cliques, A Gale-Ryser type characterization of potentially \(K_{s,t}\)-bigraphic pairs, Graphic sequences and split graphs, On the sum necessary to ensure that a degree sequence is potentially \(H\)-graphic, A characterization for a graphic sequence to be potentially \(C_{r}\)-graphic, A degree sequence variant of graph Ramsey numbers, Graphic sequences with a realization containing a union of cliques, Graphic sequences with a realization containing a generalized friendship graph, Graphic sequences with a realization containing a complete multipartite subgraph, A generalization of a conjecture due to Erdös, Jacobson and Lehel, A variation of a conjecture due to Erdös and Sós, Conditions for \(r\)-graphic sequences to be potentially \(K^{(r)}_{m+1}\)-graphic, On the potentially \(P_k\)-graphic sequences, The smallest degree sum that yields potentially \(_{k}C_{\ell}\)-graphic sequences, A variation of a classical Turán-type extremal problem, The smallest degree sum that yields potentially \(K_{r+1}-K_3\)-graphic sequences, The threshold for the Erdős, Jacobson and Lehel conjecture to be true, Two sufficient conditions for a graphic sequence to have a realization with prescribed clique size, On potentially K 5-H-graphic sequences, Potentially K m — G-graphical sequences: A survey, An Erdős-Stone Type Conjecture for Graphic Sequences, On potentially H-graphic sequences