Results 241 to 250 of about 96,090 (258)
Some of the next articles are maybe not open access.
Gallai–Ramsey Numbers of Odd Cycles and Complete Bipartite Graphs
Graphs and Combinatorics, 2018Ming Chen, Yusheng Li, Chaoping Pei
semanticscholar +1 more source
Decomposition of complete graphs into isomorphic complete bipartite graphs
2013Summary: 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
Anti-Ramsey coloring for matchings in complete bipartite graphs
Journal of combinatorial optimization, 2017Zemin Jin, Yuping Zang
semanticscholar +1 more source
Topological Indices of the Line Graph of Subdivision Graph of Complete Bipartite Graphs
, 2017A. Aslam +3 more
semanticscholar +1 more source
Efficient Biclique Counting in Large Bipartite Graphs
Proc. ACM Manag. Data, 2023Xiaowei Ye +4 more
semanticscholar +1 more source
Nowhere‐Zero Flows on Signed Complete and Complete Bipartite Graphs
Journal of Graph Theory, 2015Edita Máčajová, Edita Rollová
semanticscholar +1 more source
Total edge irregularity strength of complete graphs and complete bipartite graphs
Discrete Mathematics, 2010Stanislav Jendroľ +2 more
exaly
Zumkeller Labeling Algorithms for Complete Bipartite Graphs and Wheel Graphs
, 2015B. Balamurugan, K. Thirusangu, D. Thomas
semanticscholar +1 more source