Results 221 to 230 of about 96,090 (258)
Some of the next articles are maybe not open access.
Cospectrality of complete bipartite graphs
Linear and Multilinear Algebra, 2016Mohammad Reza Oboudi
exaly +2 more sources
On the Decomposition of Graphs into Complete Bipartite Graphs
Graphs and Combinatorics, 2007zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jinquan Dong, Yanpei Liu
openaire +2 more sources
Complete (2,2) Bipartite Graphs
Malaysian Journal of Mathematical Sciences, 2022A bipartite graph G can be treated as a (1,1) bipartite graph in the sense that, no two vertices in the same part are at distance one from each other. A (2,2) bipartite graph is an extension of the above concept in which no two vertices in the same part are at distance two from each other.
Hanif, S., Bhat, K. A., Sudhakara, G.
openaire +1 more source
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 +2 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 +2 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 +2 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 +1 more source
Ramsey Numbers of Complete Bipartite Graphs
Graphs and CombinatoricszbMATH Open Web Interface contents unavailable due to conflicting licenses.
Meng Liu, Bangwei Du
openaire +1 more source