Results 1 to 10 of about 64 (27)

On Factorable Bigraphic Pairs

open access: diamondDiscussiones Mathematicae Graph Theory, 2020
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

A Constructive Extension of the Characterization on Potentially Ks,t-Bigraphic Pairs

open access: diamondDiscussiones Mathematicae Graph Theory, 2017
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   +8 more sources

About an extremal problem of bigraphic pairs with a realization containing Ks,t

open access: diamondDiscussiones Mathematicae Graph Theory, 2023
Let $\pi=(f_1, \ldots ,f_m;g_1, \ldots ,g_n)$, where $f_1, \ldots ,f_m$ and $g_1, \ldots ,g_n$ are two non-increasing sequences of nonnegative integers. The pair $\pi=(f_1,\ldots,f_m;$ $g_1,\ldots,g_n)$ is said to be a bigraphic pair if there is a simple
Jianhua Yin, Bing Wang
doaj   +6 more sources

A Gale–Ryser type characterization of potentially Ks,t-bigraphic pairs [PDF]

open access: closedDiscrete Mathematics, 2012
Let A and B be nonincreasing lists of nonnegative integers, having lengths m and n, respectively. The pair (A;B) is potentially Ks,t-bigraphic if there is a simple bipartite graph containing Ks,t (with s vertices in the part of size m and t in the part ...
Jian-Hua Yin, Xiaofei Huang
core   +7 more sources

Bigraphic pairs with a realization containing a split bipartite-graph [PDF]

open access: closedCzechoslovak Mathematical Journal, 2019
summary:Let $K_{s,t}$ be the complete bipartite graph with partite sets $\{x_1,\ldots ,x_s\}$ and $\{y_1,\ldots ,y_t\}$. A split bipartite-graph on $(s+s')+(t+t')$ vertices, denoted by ${\rm SB}_{s+s',t+t'}$, is the graph obtained from $K_{s,t}$ by ...
Xiaozhou Yang   +3 more
core   +6 more sources

An extremal problem on bigraphic pairs with an A-connected realization

open access: closedDiscrete Mathematics, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jian-Hua Yin
core   +4 more sources

Bigraphic pairs with an A-connected realization

open access: closedDiscrete Applied Mathematics, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jing-Xin Guan, Jian-Hua Yin
core   +4 more sources

Solution to an extremal problem on bigraphic pairs with a Z 3-connected realization [PDF]

open access: closedActa Mathematica Sinica, English Series, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jian Hua Yin, Xiang Yu Dai
core   +4 more sources

Home - About - Disclaimer - Privacy