Graphic sequences with a realization containing a union of cliques
From MaRDI portal
Publication:995771
DOI10.1007/S00373-007-0737-9zbMATH Open1123.05028OpenAlexW1972537263MaRDI QIDQ995771FDOQ995771
Authors: Michael Ferrara 
Publication date: 10 September 2007
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-007-0737-9
Recommendations
- Graphic sequences with a realization containing a complete multipartite subgraph
- A note on potentially \(K_{1,1,t}\)-graphic sequences
- On potentially \(K_{r_1,r_2,\dots,r_m}\)-graphic sequences
- On the potential number of \(K_{r+1}-E(H)\)
- An extremal problem on the potentially \(P_k\)-graphic sequences
Cites Work
- The Erdős-Jacobson-Lehel conjecture on potentially \(P_k\)-graphic sequence is true
- An extremal problem on potentially \(K_{r,s}\)-graphic sequences
- The smallest degree sum that yields potentially \(K_{r,r}\)-graphic sequences
- Two sufficient conditions for a graphic sequence to have a realization with prescribed clique size
- Graphic sequences with a realization containing a friendship graph
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
- Title not available (Why is that?)
- Title not available (Why is that?)
- A General Lower Bound for Potentially H-Graphic Sequences
- A remark on the existence of finite graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (14)
- On the sum necessary to ensure that a degree sequence is potentially \(H\)-graphic
- Graphic sequences with a realization containing intersecting cliques
- Graphic sequences with a realization containing a generalized friendship graph
- Potentially \(F'_{k_1,k_2,1}\)-graphic sequences
- Graphic sequences with a realization containing a friendship graph
- Potentially K m — G-graphical sequences: A survey
- A note on potentially \(K_{1,1,t}\)-graphic sequences
- Solution to a general version of a degree sequence variant of the Erdős-Sós conjecture
- An Erdős-Stone Type Conjecture for Graphic Sequences
- tK\(_p\)-saturated graphs of minimum size
- On the potential function of an arbitrary graph \(H\)
- Graphic sequences with a realization containing a complete multipartite subgraph
- A note on the potential function of an arbitrary graph H
- Potentially graphic sequences of split graphs
This page was built for publication: Graphic sequences with a realization containing a union of cliques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q995771)
