Results 1 to 10 of about 38 (29)

Solutions to problems about potentially Ks,t-bigraphic pair

open access: yesOpen Mathematics, 2022
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   +3 more sources

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

open access: yesDiscrete Mathematics, 2012
AbstractLet 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 of size n) such that the lists of vertex degrees in the two partite sets are A and B. We give
Jian-Hua Yin, Xiao-Fei Huang
core   +4 more sources

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

open access: yesDiscussiones 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   +4 more sources

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

open access: yesDiscussiones Mathematicae Graph Theory, 2023
Let π = (f1, . . . , fm; g1, . . . , gn), where f1, . . . , fm and g1, . . . , gn are two non-increasing sequences of nonnegative integers. The pair π = (f1, . . . , fm; g1, . . .
Jianhua Yin, Bing Wang
semanticscholar   +1 more source

Bigraphic pairs with a realization containing a split bipartite-graph

open access: yesCzechoslovak Mathematical Journal, 2019
Let Ks,t be the complete bipartite graph with partite sets {x1,…, xs} and {y1,…, yt}. A split bipartite-graph on (s + s′) + (t +t′) vertices, denoted by SBs+s′,t+t′, is the graph obtained from Ks,t by adding s′ + t′ new vertices xs+1,…, xs+s′, yt+1,…, yt+
Jianhua Yin   +3 more
semanticscholar   +2 more sources

Language contact in South Oscan epigraphy [PDF]

open access: yes, 2014
This thesis examines evidence for language contact between Oscan and Greek in the corpus of Oscan inscriptions from Lucania, Bruttium and Messana. These inscriptions were written in an adapted form of the Greek alphabet from around the fourth to first ...
McDonald, Katherine Louise
core   +2 more sources

Crop resistance mechanisms to alleviate climate change-related stress [PDF]

open access: yes
Agricultura y VeterinariaCiencias AmbientalesCiencias de la ...
Acosta Motos, José Ramón   +3 more
core   +1 more source

Potentially H-bigraphic sequences

open access: yesDiscussiones Mathematicae Graph Theory, 2009
M. Ferrara   +3 more
semanticscholar   +1 more source
Some of the next articles are maybe not open access.

Home - About - Disclaimer - Privacy