Results 241 to 250 of about 2,715,030 (252)

\(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  

Locally 2-arc-transitive complete bipartite graphs

Journal of Combinatorial Theory - Series A, 2013
Dimitri Leemans, Wenwen Fan, Jiangmin Pan   +2 more
exaly  

The generalized connectivity of the line graph and the total graph for the complete bipartite graph

Applied Mathematics and Computation, 2019
Yinkui Li
exaly  

Cycle systems in the complete bipartite graph minus a one-factor

Discrete Mathematics, 2004
Dan Archdeacon
exaly  

Resistance between two vertices of almost complete bipartite graphs

Discrete Applied Mathematics, 2019
Weigen Yan
exaly  

Decomposition of Complete Bipartite Even Graphs into Closed Trails

Czechoslovak Mathematical Journal, 2003
Mirko Horňák, Mariusz Woźniak
exaly  

Decomposition of the complete bipartite graph with a 1-factor removed into cycles and stars

Discrete Mathematics, 2013
Hung-Chih Lee, Jenq-Jong Lin
exaly  

Decomposition of complete bipartite graphs into paths and stars with same number of edges

Discrete Mathematics, 2013
exaly