An extremal problem on the potentially K_r,s,t-graphic sequences
From MaRDI portal
Publication:3421036
Recommendations
- An extremal problem on potentially \(K_{r,s}\)-graphic sequences
- An extremal problem on potentially \(K_{p,1,1}\)-graphic sequences
- Potentially \(K_{r_{1},r_{2},\dots ,r_{l},r,s}\)-graphic sequences
- The smallest degree sum that yields potentially \(K_{r,r}\)-graphic sequences
- On potentially \(K_{r_1,r_2,\dots,r_m}\)-graphic sequences
Cited in
(12)- Induced subgraphs of given sizes
- An extremal problem on potentially \(K_{r,s}\)-graphic sequences
- A variation of a classical Turán-type extremal problem
- Potentially K m — G-graphical sequences: A survey
- Potentially \(F_{2m+i}\)-graphic sequences
- scientific article; zbMATH DE number 7403609 (Why is no real title available?)
- scientific article; zbMATH DE number 1293748 (Why is no real title available?)
- An extremal problem on the potentially wheel graph sequences
- Maximum number of colorings of (2k, k2)‐graphs
- scientific article; zbMATH DE number 2192177 (Why is no real title available?)
- Potentially \(K_{r_{1},r_{2},\dots ,r_{l},r,s}\)-graphic sequences
- Graphic sequences with a realization containing a generalized friendship graph
This page was built for publication: An extremal problem on the potentially \(K_{r,s,t}\)-graphic sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3421036)
