A sharp refinement of a result of Zverovich--Zverovich
classification
🧮 math.CO
keywords
sequenceelementfiniterefinementresultsharpzverovichzverovich--zverovich
read the original abstract
For a finite sequence of positive integers to be the degree sequence of a finite graph, Zverovich and Zverovich gave a sufficient condition involving only the length of the sequence, its maximal element and its minimal element. In this paper we give a sharp refinement of Zverovich--Zverovich's result.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.