Cycles in graphs of fixed girth with large size.

József Solymosi Ching Wong

Published in: Eur. J. Comb. (2017)

Keyphrases

fixed size
graph matching
graph representation
uniform random
computational complexity
fixed number
bounded treewidth
maximum clique
case study
pairwise
directed graph
spanning tree
small size