Graphic sequences with a realization containing cycles \(C_3, \dots, C_\ell \)
From MaRDI portal
Publication:2010728
DOI10.1016/j.amc.2019.02.003zbMath1428.05068OpenAlexW2917530560MaRDI QIDQ2010728
Kun Ye, Jia-Yun Li, Jian Hua Yin
Publication date: 27 November 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2019.02.003
Cites Work
- A characterization for a graphic sequence to be potentially \(C_{r}\)-graphic
- A variation of an extremal theorem due to Woodall
- Pancyclic graphs and a conjecture of Bondy and Chvatal
- An extremal problem on potentially \(K_{r,s}\)-graphic sequences
- Algorithms for constructing graphs and digraphs with given valences and factors
- Two sufficient conditions for a graphic sequence to have a realization with prescribed clique size
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item