Graphic sequences with a realization containing a union of cliques
From MaRDI portal
(Redirected from Publication:995771)
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
- scientific article; zbMATH DE number 3743297 (Why is no real title available?)
- scientific article; zbMATH DE number 1286471 (Why is no real title available?)
- scientific article; zbMATH DE number 2123255 (Why is no real title available?)
- scientific article; zbMATH DE number 867707 (Why is no real title available?)
- A General Lower Bound for Potentially H-Graphic Sequences
- A remark on the existence of finite graphs
- An extremal problem on potentially \(K_{r,s}\)-graphic sequences
- 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
- The Erdős-Jacobson-Lehel conjecture on potentially \(P_k\)-graphic sequence is true
- 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
Cited in
(14)- Potentially \(F'_{k_1,k_2,1}\)-graphic sequences
- Graphic sequences with a realization containing intersecting cliques
- Graphic sequences with a realization containing a complete multipartite subgraph
- Graphic sequences with a realization containing a friendship graph
- Potentially graphic sequences of split graphs
- An Erdős-Stone Type Conjecture for Graphic Sequences
- Potentially K m — G-graphical sequences: A survey
- Graphic sequences with a realization containing a generalized friendship graph
- On the sum necessary to ensure that a degree sequence is potentially \(H\)-graphic
- On the potential function of an arbitrary graph \(H\)
- Solution to a general version of a degree sequence variant of the Erdős-Sós conjecture
- A note on the potential function of an arbitrary graph H
- A note on potentially \(K_{1,1,t}\)-graphic sequences
- tK\(_p\)-saturated graphs of minimum size
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)
