A characterization for a graphic sequence to be potentially \(C_{r}\)-graphic
From MaRDI portal
Publication:625906
DOI10.1007/s11425-010-3124-6zbMath1226.05092OpenAlexW2010604630MaRDI QIDQ625906
Publication date: 25 February 2011
Published in: Science China. Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11425-010-3124-6
Related Items
On factorable bigraphic pairs ⋮ Graphic sequences with a realization containing cycles \(C_3, \dots, C_\ell \)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Erdős-Jacobson-Lehel conjecture on potentially \(P_k\)-graphic sequence is true
- The k-factor conjecture is true
- An extremal problem on potentially \(K_{r,s}\)-graphic sequences
- A variation of a classical Turán-type extremal problem
- An extremal problem on the potentially \(P_k\)-graphic sequences
- The topology of Julia sets for polynomials
- The threshold for the Erdős, Jacobson and Lehel conjecture to be true
- 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