A sufficient condition for a pair of sequences to be bipartite graphic
classification
🧮 math.CO
keywords
sequencesbipartiteconditionpairsufficientdegreeelementsfinite
read the original abstract
We present a sufficient condition for a pair of finite integer sequences to be degree sequences of a bipartite graph, based only on the lengths of the sequences and their largest and smallest elements.
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.