Results 231 to 240 of about 96,090 (258)

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

On Vertex-Disjoint Complete Bipartite Subgraphs in a Bipartite Graph

Graphs and Combinatorics, 1999
It 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

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

On the cyclic decomposition of complete graphs into bipartite graphs [PDF]

Australas. J Comb., 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Saad I. El-Zanati, Charles Vanden Eynden, Narong Punnim   +2 more
openaire   +1 more source

Altitude of small complete and complete bipartite graphs [PDF]

Australas. J Comb., 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alewyn P. Burger, Ernest J. Cockayne, Christina M. Mynhardt   +2 more
openaire   +1 more source

On the vulnerability of permutation graphs of complete and complete bipartite graphs

1991
The integrity of a graph \(G\) is defined as \(\min\{| S|+m(G-S)\}\) taken over all subsets \(S\) of \(V(G)\), where \(m(G-S)\) is the order of the largest component of \(G-S\). The toughness of \(G\) is defined as \(\min\{| S|/w(G-S)\}\) taken over all disconnecting subsets \(S\) of \(G\), where \(w(G-S)\) is the number of components of \(G-S\).
Guichard, D., Piazza, Barry L., Stueckle, Sam K.   +2 more
openaire   +1 more source

Weak saturation numbers of complete bipartite graphs in the clique

Journal of Combinatorial Theory - Series A, 2021
Gal Kronenberg, Natasha Morrison
exaly  

Connectedness of friends-and-strangers graphs of complete bipartite graphs and others

Discrete Mathematics, 2023
Yaojun Chen
exaly