Graphic sequences and split graphs
From MaRDI portal
Publication:519245
DOI10.1007/s10255-016-0622-5zbMath1410.05027OpenAlexW2525827080MaRDI QIDQ519245
Meng-Xiao Yin, Lei Meng, Jian Hua Yin
Publication date: 4 April 2017
Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10255-016-0622-5
Related Items (3)
A further result on the potential-Ramsey number of G1 and G2 ⋮ The potential-Ramsey number of $K_n$ and $K_t^{-k}$ ⋮ A new lower bound on the potential-Ramsey number of two graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Rao-type characterization for a sequence to have a realization containing a split graph
- A new kind of trivariate \(C^1\) macro-element
- The Erdős-Jacobson-Lehel conjecture on potentially \(P_k\)-graphic sequence is true
- An extremal problem on the potentially \(P_k\)-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
- Potentially K m — G-graphical sequences: A survey
This page was built for publication: Graphic sequences and split graphs