Results 201 to 210 of about 5,946 (233)

On bisections of graphs without complete bipartite graphs

Journal of Graph Theory, 2021
AbstractA 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   +2 more sources

Packing two bipartite graphs into a complete bipartite graph

Journal of Graph Theory, 1997
A 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

Complete bipartite graphs deleted in Ramsey graphs

Theoretical Computer Science, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yan Li 0070, Yusheng Li 0001, Ye Wang 0016   +2 more
openaire   +2 more sources

The Bipartite-Cylindrical Crossing Number of the Complete Bipartite Graph

Graphs and Combinatorics, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bernardo M. Ábrego, Silvia Fernández-Merchant, Athena Sparks   +2 more
openaire   +2 more sources

Complete bipartite free graphs

Ars Comb., 2003
The 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, Ana Diánez, Pedro García-Vázquez, Juan Carlos Valenzuela   +3 more
openaire   +1 more source

Ramsey Numbers of Complete Bipartite Graphs

Graphs and Combinatorics
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Meng Liu, Bangwei Du
openaire   +1 more source

Hall parameters of complete and complete bipartite graphs

Journal of Graph Theory, 2002
AbstractGiven 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   +2 more sources

THE TOTAL IRREGULARITY STRENGTH OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS

Far East Journal of Mathematical Sciences (FJMS), 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tilukay, M. I., Tomasouw, B. P., Rumlawang, F. Y., Salman, A. N. M.   +3 more
openaire   +2 more sources

Decomposition of complete bipartite graphs

Ars Comb., 1997
The paper starts with the well-known result of A. Rosa from 1966 [Theory Graphs, Int. Symp. Rome 1966, 349-355, Dunod, Paris (1967; Zbl 0193.53204)] on the cyclic decomposition of a complete graph \(K_{2n+1}\) into edge-disjoint copies of a graph \(G\) having \(n\) edges.
openaire   +1 more source

Complete Graphs and Bipartite Graphs in a Random Graph

2021 5th International Conference on Vision, Image and Signal Processing (ICVISP), 2021
Lijin Feng, Jackson Barr
openaire   +1 more source