Results 1 to 10 of about 606,384 (60)
On Factorable Bigraphic Pairs [PDF]
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, .
Yin Jian-Hua, Li Sha-Sha
doaj +5 more sources
Solutions to problems about potentially Ks,t-bigraphic pair
Let S=(a1,…,am;b1,…,bn)S=\left({a}_{1},\ldots ,{a}_{m};\hspace{0.33em}{b}_{1},\ldots ,{b}_{n}), where a1,…,am{a}_{1},\ldots ,{a}_{m} and b1,…,bn{b}_{1},\ldots ,{b}_{n} are two nonincreasing sequences of nonnegative integers. The pair S=(a1,…,am;b1,…,bn)S=
Yin Jian-Hua, Zhang Liang
doaj +5 more sources
A Constructive Extension of the Characterization on Potentially Ks,t-Bigraphic Pairs [PDF]
Let Ks,t be the complete bipartite graph with partite sets of size s and t. Let L1 = ([a1, b1], . . . , [am, bm]) and L2 = ([c1, d1], . . . , [cn, dn]) be two sequences of intervals consisting of nonnegative integers with a1 ≥ a2 ≥ . . . ≥ am and c1 ≥ c2
Guo Ji-Yun, Yin Jian-Hua
doaj +5 more sources
Potentially H-Bigraphic Sequences [PDF]
We extend the notion of a potentially H-graphic sequence as fol-lows. Let A and B be nonnegative integer sequences. The sequence pair S = (A; B) is said to be bigraphic if there is some bipartite graph G = (X [Y; E) such that A and B are the degrees of ...
Mark Siggers
exaly +4 more sources
Some of the next articles are maybe not open access.
The Sum Necessary to Ensure That a Degree Sequence Pair Has an A-Connected Realization
Discrete Applied Mathematics, 2021Jing-Xin Guan
exaly
About an Extremal Problem of Bigraphic Pairs With a Realization Containing K s,t
Discussiones Mathematicae - Graph Theory, 2020Jianhua Yin
exaly
Bigraphic Pairs With an A-Connected Realization
Discrete Applied Mathematics, 2018Jing-Xin Guan
exaly
A Gale–Ryser Type Characterization of Potentially Ks,t-Bigraphic Pairs
Discrete Mathematics, 2012exaly

