𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An algorithm for counting short cycles in bipartite graphs

✍ Scribed by Halford, T.R.; Chugg, K.M.

Book ID
114639053
Publisher
IEEE
Year
2006
Tongue
English
Weight
245 KB
Volume
52
Category
Article
ISSN
0018-9448

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Cycles in bipartite graphs and an applic
Cycles in bipartite graphs and an application in number theory
✍ GΓ‘bor N. SΓ‘rkΓΆzy πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 304 KB

Let G = G(A, B) be a bipartite graph with IAl = u, IBl = U , and let I be a positive integer. In this paper we prove the following result: If u 4 u, uu 5 n, rn = J€(G)I, and then G contains a C2/.