Graphic sequences with a realization containing a generalized friendship graph
From MaRDI portal
Publication:998359
DOI10.1016/j.disc.2007.11.075zbMath1167.05310OpenAlexW1966649669MaRDI QIDQ998359
Gang Chen, John R. Schmitt, Jian Hua Yin
Publication date: 28 January 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.11.075
Related Items (7)
Graphic sequences with a realization containing intersecting cliques ⋮ A note on the potential function of an arbitrary graph H ⋮ Spectral radii of friendship graphs and their connected induced subgraphs ⋮ Solution to a general version of a degree sequence variant of the Erdős-Sós conjecture ⋮ Potentially K m — G-graphical sequences: A survey ⋮ On the potential function of an arbitrary graph \(H\) ⋮ tK\(_p\)-saturated graphs of minimum size
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Graphic sequences with a realization containing a union of cliques
- The Erdős-Jacobson-Lehel conjecture on potentially \(P_k\)-graphic sequence is true
- Extremal graphs for intersecting cliques
- An extremal problem on potentially \(K_{r,s}\)-graphic sequences
- An extremal problem on the potentially \(P_k\)-graphic sequences
- The smallest degree sum that yields potentially \(K_{r,r}\)-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
- A remark on the existence of finite graphs
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
- A General Lower Bound for Potentially H-Graphic Sequences
This page was built for publication: Graphic sequences with a realization containing a generalized friendship graph
