On Factorable Bigraphic Pairs
Let S = (a1,. . . , am; b1, . . . , bn), where a1, . . . , am and b1, . . . , bn are two sequences of nonnegative integers. We say that S is a bigraphic pair if there exists a simple bipartite graph G with partite sets {x1, x2, . . . , xm} and {y1, y2, . . . , yn} such that dG(xi) = ai for 1 ≤ i ≤ m...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Zielona Góra
2020-08-01
|
| Series: | Discussiones Mathematicae Graph Theory |
| Subjects: | |
| Online Access: | https://doi.org/10.7151/dmgt.2147 |