Results 211 to 220 of about 5,946 (233)

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

Some of the next articles are maybe not open access.

Related searches:

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

Effective resistances and spanning trees in the complete bipartite graph plus a matching

Discrete Applied Mathematics, 2021
Jun Ge
exaly  

Counting spanning trees in a complete bipartite graph which contain a given spanning forest

Journal of Graph Theory, 2022
Jun Ge, Fengming Dong
exaly  

The outerplanar crossing number of the complete bipartite graph

Discrete Applied Mathematics, 2022
Silvia Fernández
exaly  

Decomposition of complete graphs into isomorphic complete bipartite graphs

2013
Summary: A decomposition of a complete graph \(K\) into disjoint copies of a complete bipartite graph \(K_{s,t}\) is called a \(K_{s,t}\)-design of order \(n\). The existence problem of \(K_{s,t}\)-designs has been completely solved for the graphs \(K_{1,t}\) for \(k\geq 1\), \(K_{2^{a},2^{b}}\) for \(a,b\geq 1\), \(K_{2, 3}\) and \(K_{3, 3}\). In this
openaire   +2 more sources

\(P_7\)-factorization of complete bipartite graphs [PDF]

Australas. J Comb., 2005
Summary: We show that necessary and sufficient conditions for existence of a \(P_7\)-factorization of the complete bipartite graph \(K_{m,n}\) are (1) \(4n\geq 3m\), (2) \(4m\geq 3n\), (3) \(m+n\equiv 0 \pmod 7\), and (4) \(7mn/[6(m+n)]\) is an integer.
openaire   +1 more source

Cycle Multiplicity of Total Graph of Complete Bipartite Graph

Open Journal of Discrete Mathematics, 2023
Yinkui Li
exaly  

The Extremal Number of the Subdivisions of the Complete Bipartite Graph

SIAM Journal on Discrete Mathematics, 2020
Oliver Janzer
exaly