scientific article; zbMATH DE number 1286471
From MaRDI portal
Publication:4242917
DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199810)29:2<63::AID-JGT2>3.0.CO;2-A" /><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
Publication date: 11 May 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (27)
Graphic sequences with a realization containing intersecting cliques ⋮ A variation of a classical Turán-type extremal problem ⋮ A note on the potential function of an arbitrary graph H ⋮ A Gale-Ryser type characterization of potentially \(K_{s,t}\)-bigraphic pairs ⋮ A characterization for a graphic sequence to be potentially \(C_{r}\)-graphic ⋮ Solution to a general version of a degree sequence variant of the Erdős-Sós conjecture ⋮ The smallest degree sum that yields potentially \(_{k}C_{\ell}\)-graphic sequences ⋮ The smallest degree sum that yields potentially \(K_{r+1}-K_3\)-graphic sequences ⋮ Graphic sequences and split graphs ⋮ On the sum necessary to ensure that a degree sequence is potentially \(H\)-graphic ⋮ Stability of the Potential Function ⋮ The threshold for the Erdős, Jacobson and Lehel conjecture to be true ⋮ 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 ⋮ On potentially K 5-H-graphic sequences ⋮ Potentially K m — G-graphical sequences: A survey ⋮ On potentially H-graphic sequences ⋮ A degree sequence variant of graph Ramsey numbers ⋮ On the potential function of an arbitrary graph \(H\) ⋮ 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 ⋮ Two sufficient conditions for a graphic sequence to have a realization with prescribed clique size ⋮ An Erdős-Stone Type Conjecture for Graphic Sequences ⋮ A sufficient condition for r - graphic sequences to be potentially
This page was built for publication:
