On the Computational Complexity of Finding Bipartite Graphs with a Small Number of Short Cycles and Large Girth.

Ali Dehghan, Amir H. Banihashemi

Browse the full ITW paper archive.