Graphic sequences with a realization containing a complete multipartite subgraph
From MaRDI portal
Publication:998452
DOI10.1016/j.disc.2007.10.047zbMath1168.05016OpenAlexW2000144448MaRDI QIDQ998452
Michael Ferrara, Ronald J. Gould, Guantao Chen, John R. Schmitt
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.10.047
Related Items
On the sum necessary to ensure that a degree sequence is potentially \(H\)-graphic, Potentially K m — G-graphical sequences: A survey, An Erdős-Stone Type Conjecture for Graphic Sequences
Cites Work
- Potentially \(K_{r_{1},r_{2},\dots ,r_{l},r,s}\)-graphic sequences
- 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
- On the structure of linear graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
