Results 191 to 200 of about 10,299 (219)
Some of the next articles are maybe not open access.
Packing two bipartite graphs into a complete bipartite graph
Journal of Graph Theory, 1997A bipartite graph \(G\) admits an \((a,b)\)-bipartition if \(G\) has a bipartition \((X,Y)\) such that \(|X|=a\) and \(|Y|=b\). Two bipartite graphs \(G\) and \(H\) are compatible if, for some integers \(a\) and \(b\), both \(G\) and \(H\) admit an \((a,b)\)-bipartition. In the paper it is proved that any two compatible \(C_4\)-free bipartite graphs of
openaire +2 more sources
ACM Transactions on Algorithms, 2006
Graph H is a root of graph G if there exists a positive integer k such that x and y are adjacent in G if and only if their distance in H is at most k
openaire +2 more sources
Graph H is a root of graph G if there exists a positive integer k such that x and y are adjacent in G if and only if their distance in H is at most k
openaire +2 more sources
On judicious bipartitions of graphs
Combinatorica, 2016zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jie Ma 0002, Xingxing Yu
openaire +2 more sources
Bipartitions of oriented graphs
Journal of Combinatorial Theory, Series B, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jianfeng Hou, Shufei Wu
openaire +2 more sources
Combinatorica, 1992
Two simple graphs \(G\) and \(H\) can be packed if \(G\) is isomorphic to a subgraph of the complement \(\overline H\) of \(H\). A sufficient condition is known for the existence of packing in terms of the product of the maximal degrees of \(G\) and \(H\).
Péter Hajnal, Mario Szegedy
openaire +2 more sources
Two simple graphs \(G\) and \(H\) can be packed if \(G\) is isomorphic to a subgraph of the complement \(\overline H\) of \(H\). A sufficient condition is known for the existence of packing in terms of the product of the maximal degrees of \(G\) and \(H\).
Péter Hajnal, Mario Szegedy
openaire +2 more sources
Bichromaticity of bipartite graphs
Journal of Graph Theory, 1985AbstractLet B be a bipartite graph with edge set E and vertex bipartition M, N. The bichromaticity β(B) is defined as the maximum number β such that a complete bipartite graph on β vertices is obtainable from B by a sequence of identifications of vertices of M or vertices of N. Let μ = max{∣M∣, ∣N∣}. Harary, Hsu, and Miller proved that β(B) ≥ μ + 1 and
openaire +1 more source
On the contour of bipartite graphs
Discrete Applied Mathematics, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Danilo Artigas, R. Sritharan
openaire +1 more source
Bipartite Graphs and Coverings
2011In many real world applications, data are organized by coverings, instead of partitions. Covering-based rough sets have been proposed to cope with this type of data. Covering-based rough set theory is more general than rough set theory, then there is a need to employ sophisticated theories to make it more adaptive to applications.
Shiping Wang +2 more
openaire +1 more source
SIAM Journal on Discrete Mathematics, 2009
For each $s\geq2$, there exists $m_0$ such that the following holds for all $m\geq m_0$: Let $G$ be a bipartite graph with $n=ms$ vertices in each partition set. If $m$ is odd and minimum degree $\delta(G)\geq\frac{n+3s}{2}-2$, then $G$ contains $m$ vertex-disjoint copies of $K_{s,s}$. If $m$ is even, the same holds under the weaker condition $\delta(G)
openaire +1 more source
For each $s\geq2$, there exists $m_0$ such that the following holds for all $m\geq m_0$: Let $G$ be a bipartite graph with $n=ms$ vertices in each partition set. If $m$ is odd and minimum degree $\delta(G)\geq\frac{n+3s}{2}-2$, then $G$ contains $m$ vertex-disjoint copies of $K_{s,s}$. If $m$ is even, the same holds under the weaker condition $\delta(G)
openaire +1 more source
Choosability of bipartite graphs
Ars Comb., 1996A graph is called \(k\)-choosable if for any assignment of lists of size at least \(k\) to the vertices, it is possible to properly color the graph so that every vertex receives a color from its list. Let \(n(k)\) be the smallest number of vertices of a bipartite non-\(k\)-choosable graph. It was proved by \textit{P. Erdős, A. L. Rubin}, and \textit{H.
Denis Hanson +2 more
openaire +1 more source