Results 231 to 240 of about 2,876,957 (249)
Some of the next articles are maybe not open access.

On the cyclic decomposition of complete graphs into bipartite graphs

Australas. J Comb., 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Saad I. El-Zanati   +2 more
openaire   +2 more sources

Altitude of small complete and complete bipartite graphs

Australas. J Comb., 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alewyn P. Burger   +2 more
openaire   +2 more sources

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

Total edge irregularity strength of complete graphs and complete bipartite graphs

Discrete Mathematics, 2010
Stanislav Jendrol'   +2 more
exaly  

Complete bipartite graphs with a unique regular embedding

Journal of Combinatorial Theory Series B, 2008
Gareth A Jones   +2 more
exaly  

\(P_7\)-factorization of complete bipartite graphs

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   +2 more sources

Decomposition of complete bipartite graphs into paths and cycles

Discrete Mathematics, 2014
Appu Muthusamy
exaly  

Regular orientable embeddings of complete bipartite graphs

Journal of Graph Theory, 2005
Young Soo Kwon, Jin Ho Kwak
exaly  

Home - About - Disclaimer - Privacy