Results 221 to 230 of about 2,715,030 (252)
Some of the next articles are maybe not open access.
Packings by Complete Bipartite Graphs
SIAM Journal on Algebraic Discrete Methods, 1986Summary: Given any set \({\mathcal B}\) of complete bipartite graphs, we ask whether a graph H admits a \({\mathcal B}\)-factor, i.e., a spanning subgraph, each of whose components is a member of \({\mathcal B}\). More generally, we seek in H a maximum \({\mathcal B}\)-packing, i.e., a \({\mathcal B}\)-factor of a maximum size subgraph of H.
Hell, P., Kirkpatrick, D. G.
openaire +1 more source
Pagenumber of complete bipartite graphs
Journal of Graph Theory, 1988AbstractGiven an ordering of the vertices of a graph around a circle, a page is a collection of edges forming noncrossing chords. A book embedding is a circular permutation of the vertices together with a partition of the edges into pages. Thepagenumber t(G)(also called book thickness) is the minimum number of pages in a book embedding of G. We present
Douglas J. Muder +2 more
openaire +3 more sources
The Coarseness of the Complete Bipartite Graph
Canadian Journal of Mathematics, 1969The coarseness, c(G), of a graph G is the maximum number of edge-disjoint, non-planar graphs whose union is G. The coarseness of the complete graph has been investigated elsewhere (1; 2). We consider the coarseness of the complete bipartite, or 2-coloured, graph, Km,n, consisting of sets of mand nvertices, each member of one set being joined by an edge
Beineke, L. W., Guy, R. K.
openaire +2 more sources
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 +3 more sources
On bisections of graphs without complete bipartite graphs
Journal of Graph Theory, 2021AbstractA bisection of a graph is a bipartition of its vertex set in which the two classes differ in size by at most one. For a random bisection of a graph with edges, one expects edges spans in one vertex class. Bollobás and Scott asked for conditions that guarantee a bisection in which both classes span at most edges simultaneously.
Jianfeng Hou, Shufei Wu
openaire +3 more sources
The Bipartite-Cylindrical Crossing Number of the Complete Bipartite Graph
Graphs and Combinatorics, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bernardo M. Ábrego +2 more
openaire +3 more sources
Complete bipartite free graphs
Ars Comb., 2003The authors study the maximum number of edges in a graph of order \(n\) not containing the complete bipartite graph \(K_{t,t}\) as a subgraph. The upper bound in terms of \(n\) and \(t\) together with corresponding sharpness examples is presented.
Martín Cera +3 more
openaire +2 more sources
Ramsey Numbers of Complete Bipartite Graphs
Graphs and CombinatoricszbMATH Open Web Interface contents unavailable due to conflicting licenses.
Meng Liu, Bangwei Du
openaire +2 more sources
Hall parameters of complete and complete bipartite graphs
Journal of Graph Theory, 2002AbstractGiven a graph G, for each υ ∈V(G) let L(υ) be a list assignment to G. The well‐known choice number c(G) is the least integer j such that if |L(υ)| ≥j for all υ ∈V(G), then G has a proper vertex colouring ϕ with ϕ(υ) ∈ L (υ) (∀υ ∈V(G)). The Hall number h(G) is like the choice number, except that an extra non‐triviality condition, called Hall's ...
Mathew Cropper, Anthony J. W. Hilton
openaire +3 more sources
On Vertex-Disjoint Complete Bipartite Subgraphs in a Bipartite Graph
Graphs and Combinatorics, 1999It is proved that if \(G=(X,Y;E)\) is a bipartite graph with \(|X|=|Y|=4s\), \(s\geq 2\), and the minimum degree of \(G\) is at least \(4s-3\), then \(G\) contains four vertex-disjoint copies of \(K_{s,s}\).
openaire +1 more source