Bipartite graph - Open Access .click

Combinatorics, Probability and Computing, 1997
In this note we give a probabilistic proof of the existence of an n-vertex graph Gn, n=1, 2, [ctdot ], such that, for some constant c>0, the edges of Gn cannot be covered by n−c log n complete bipartite subgraphs of Gn. This result improves a previous bound due to F. R. K. Chung and is the best possible up to a constant.
Vojtech Rödl, Andrzej Rucinski 0001
openaire +2 more sources

A Bipartite Graph That Is Not the $γ$-Graph of a Bipartite Graph

2020
For a graph $G = (V, E)$, the $γ$-graph of $G$ is the graph whose vertex set is the collection of minimum dominating sets, or $γ$-sets of $G$, and two $γ$-sets are adjacent if they differ by a single vertex and the two different vertices are adjacent in $G$.
openaire +1 more source

On the Nullity of Bipartite Graphs

Graphs and Combinatorics, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources

Embeddings of bipartite graphs

Journal of Graph Theory, 1983
AbstractIf G is a bipartite graph with bipartition A, B then let Gm,n(A, B) be obtained from G by replacing each vertex a of A by an independent set a1, …, am, each vertex b of B by an independent set b1,…, bn, and each edge ab of G by the complete bipartite graph with edges aibj (1 ≤ i ≤ m and 1 ≤ j ≤ n).
Mohammed Abu-Sbeih, Torrence D. Parsons
openaire +1 more source

discrete mathematics and combinatorics
theoretical computer science
bipartite graphs

mathematics - combinatorics
fos: mathematics
extremal problems in graph theory

combinatorics math.co
mathematics
paths and cycles