Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference19 articles.
1. Barrus, M.D., Donovan, E.: Neighborhood degree lists of graphs. Discrete Math. 341(1), 175–183 (2018)
2. Barrus, M.D.: Hereditary unigraphs and Erdős-Gallai equalities. Discrete Math. 313(21), 2469–2481 (2013)
3. Bauer, D., Broersma, H.J., van den Heuvel, J., Kahl, N., Nevo, A., Schmeichel, E., Woodall, D.R., Yatauro, M.: Best monotone degree conditions for graph properties: a survey. Graphs Combin. 31, 1–22 (2015)
4. Brylawski, T.: The lattice of integer partitions. Discrete Math. 6(3), 201–219 (1973)
5. Chvátal, V., Hammer, P.L.: Set-packing and threshold graphs, Research Report, Comp. Sci. Dept. University of Waterloo, Canada CORR, pp. 73–21. (1973)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The principal Erdős–Gallai differences of a degree sequence;Discrete Mathematics;2022-04
2. Forced Edges and Graph Structure;Journal of Research of the National Institute of Standards and Technology;2019-11-19