Graphic sequences and split graphs-Reference-Cited by-同舟云学术

Graphic sequences and split graphs

Published:2016-10 Issue:4 Volume:32 Page:1005-1014
ISSN:0168-9673
Container-title:Acta Mathematicae Applicatae Sinica, English Series
language:en
Short-container-title:Acta Math. Appl. Sin. Engl. Ser.

Author:

Yin Jian-hua,Meng Lei,Yin Meng-Xiao

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics

Link

http://link.springer.com/content/pdf/10.1007/s10255-016-0622-5.pdf

Reference14 articles.

1. Erdős, P., Gallai, T. Graphs with prescribed degrees of vertices (Hungarian). Mat. Lapok, 11: 264–274 (1960)

2. Erdős, P., Jacobson, M.S., Lehel, J. Graphs realizing the same degree sequences and their respective clique numbers. In: Y. Alavi et al., (Eds.), Graph Theory, Combinatorics and Applications, Vol. 1, John Wiley & Sons, New York, 1991, 439–449

3. Gould, R.J., Jacobson, M.S., Lehel, J. Potentially G-graphical degree sequences. In: Y. Alavi et al., (Eds.), Combinatorics, Graph Theory, and Algorithms, Vol. 1, New Issues Press, Kalamazoo Michigan, 1999, 451–460

4. Kleitman, D.J., Wang, D.L. Algorithm for constructing graphs and digraphs with given valences and factors. Discrete Math., 6: 79–88 (1973)

5. Lai, C.H., Hu, L.L. Potentially K m - G-graphical Sequences: a Survey. Czechoslovak Mathematical Journal, 59(4): 1059–1075 (2009)

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The potential-Ramsey number of $K_n$ and $K_t^{-k}$;Czechoslovak Mathematical Journal;2022-03-01

2. A New Lower Bound on the Potential-Ramsey Number of Two Graphs;Acta Mathematicae Applicatae Sinica, English Series;2021-01

3. A further result on the potential-Ramsey number of G1 and G2;Filomat;2019