Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Ali Dehghan 0001, Amir H. Banihashemi. On Finding Bipartite Graphs With a Small Number of Short Cycles and Large Girth. IEEE Transactions on Information Theory, 66(10):6024-6036, 2020. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: On the Computational Complexity of Finding Bipartite Graphs with a Small Number of Short Cycles and Large GirthAli Dehghan 0001, Amir H. Banihashemi. itw 2019: 1-5 [doi] Cospectral Bipartite Graphs with the Same Degree Sequences but with Different Number of Large CyclesAli Dehghan 0001, Amir H. Banihashemi. gc, 35(6):1673-1693, 2019. [doi] Finding Long Directed Cycles Is Hard Even When DFVS Is Small or Girth Is LargeAshwin Jacob, Michal Wlodarczyk 0001, Meirav Zehavi. esa 2023: [doi]
The following publications are possibly variants of this publication: