Bipartite graphs with no K6 minor by Chudnovsky, M, Scott, A, Seymour, P, Spirkl, S

“…<br> But what if we restrict ourselves to bipartite graphs? The first statement remains true: for every ε > 0 there are arbitrarily large bipartite graphs with average degree at least 8 − ε and no K6 minor. …”

Bayesian nonparametric models for bipartite graphs by Caron, F

“…We develop a novel Bayesian nonparametric model for random bipartite graphs. The model is based on the theory of completely random measures and is able to handle a potentially infinite number of nodes. …”

Book drawings of complete bipartite graphs by de Klerk, E, Pasechnik, D, Salazar, G

On a theorem for edge colorings in bipartite graphs / by 295797 Chong, Kong-Ming

FPGA implementation of bipartite graph matching algorithm / by Kua Wee Soon, 1983-, Nasir Shaikh Husin, Fakulti Kejuruteraan Elektrik

Detection number of bipartite graphs and cubic graphs by Frederic Havet, Nagarajan Paramaguru, Rathinaswamy Sampathkumar

“…We also show that the detection number of every bipartite graph of minimum degree at least 3 is at most 2. …”
Get full text

Cohesive Subgraph Identification in Weighted Bipartite Graphs by Xijuan Liu, Xiaoyang Wang

Subjects: “…bipartite graph…”
Get full text

Per-Spectral Characterizations Of Some Bipartite Graphs by Wu Tingzeng, Zhang Heping

“…In this paper, we investigate when a complete bipartite graph Kp,p with some edges deleted is determined by its permanental spectrum. …”
Get full text

Edge condition for long cycles in bipartite graphs by Lech Adamus

Get full text

A note on pm-compact bipartite graphs by Liu Jinfeng, Wang Xiumei

“…Matching-covered PM-compact bipartite graphs have been characterized. In this paper, we show that any PM-compact bipartite graph G with δ (G) ≥ 2 has an ear decomposition such that each graph in the decomposition sequence is also PM-compact, which implies that G is matching-covered…”
Get full text

Decomposition of Certain Complete Bipartite Graphs into Prisms by Froncek Dalibor

“…Häggkvist [6] proved that every 3-regular bipartite graph of order 2n with no component isomorphic to the Heawood graph decomposes the complete bipartite graph K6n,6n. …”
Get full text

On degree sets and the minimum orders in bipartite graphs by Manoussakis Y., Patil H.P.

“…More general, for a given pair (S, T) of finite, nonempty sets of positive integers of the same cardinality, it is shown that there exists a bipartite graph B(X, Y ) such that D(X) = S, D(Y ) = T and the minimum orders of different types are obtained for such graphs…”
Get full text

Spectral and localization properties of random bipartite graphs by C.T. Martínez-Martínez, J.A. Méndez-Bermúdez, Yamir Moreno, Jair J. Pineda-Pineda, José M. Sigarreta

“…Bipartite graphs are often found to represent the connectivity between the components of many systems such as ecosystems. …”
Get full text

Automorphism groups of some families of bipartite graphs by K.G. Sreekumar, K. Manilal

“…<p class="p1">This paper discusses the automorphism group of a<span class="Apple-converted-space">  </span>class of<span class="Apple-converted-space">  </span>weakly semiregular bipartite graphs and its subclass called <em>WSB</em>_<em>END</em> graphs.…”
Get full text

Maximum Semi-Matching Problem in Bipartite Graphs by Katrenič Ján, Semanišin Gabriel

Subjects: Get full text

Antimagic Labeling of Some Biregular Bipartite Graphs by Deng Kecai, Li Yunfei

“…This paper shows the following results. (1) Each connected (2, k)-biregular (k ≥ 3) bipartite graph is antimagic; (2) Each (k, pk)-biregular (k ≥ 3, p ≥ 2) bipartite graph is antimagic; (3) Each (k, k2 + y)-biregular (k ≥ 3, y ≥ 1) bipartite graph is antimagic.…”
Get full text

A Note on the Permanental Roots of Bipartite Graphs by Zhang Heping, Liu Shunyi, Li Wei

“…We are interested in finding whether the permanental roots of a bipartite graph G have symmetric property as the spectrum of G. …”
Get full text

Counting shellings of complete bipartite graphs and trees by Gao, Yibo, Peng, Junyao

“…In this paper, we focus on complete bipartite graphs and trees. For complete bipartite graphs, we obtain an exact formula for their shelling numbers. …”
Get full text

Pure pairs. IV. Trees in bipartite graphs by Scott, AD, Seymour, P, Spirkl, S

An attempt to classify bipartite graphs by their chromatic Polynomial. by Hasni, Roslan