Conditions for r-graphic sequences to be potentially K^(r)_m+1-graphic
From MaRDI portal
Publication:1045022
Recommendations
Cites work
- A generalization of a conjecture due to Erdös, Jacobson and Lehel
- Algorithms for constructing graphs and digraphs with given valences and factors
- An extremal problem on the potentially \(P_k\)-graphic sequences
- Conditions for sequences to be r-graphic
- scientific article; zbMATH DE number 3169205 (Why is no real title available?)
- scientific article; zbMATH DE number 3758373 (Why is no real title available?)
- scientific article; zbMATH DE number 1286471 (Why is no real title available?)
- scientific article; zbMATH DE number 867707 (Why is no real title available?)
- Some Properties of Graphs with Multiple Edges
- The Erdős-Jacobson-Lehel conjecture on potentially \(P_k\)-graphic sequence is true
Cited in
(8)- On multigraphic and potentially multigraphic sequences
- Recognition of split-graphic sequences
- Two sufficient conditions for a graphic sequence to have a realization with prescribed clique size
- Graphical sequences of some family of induced subgraphs
- scientific article; zbMATH DE number 5734066 (Why is no real title available?)
- A sufficient condition for \(r\)-graphic sequences to be potentially \(K^{(r)}_{l,m}\)
- r-graphic sequences and r-complete subgraphs
- A note for integer sequences to be potentially \(K_{r+1}\)-graphic
This page was built for publication: Conditions for \(r\)-graphic sequences to be potentially \(K^{(r)}_{m+1}\)-graphic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1045022)