Bilyana Shoilekova

Learn More
We develop a general methodology to enumerate families of graphs. To this aim we write down a generic grammar to decompose a graph family into 3-connected components, thereby reducing the enumeration of a family of graphs to the enumeration of the 3-connected graphs in the family. The latter task is mostly easier, in particular for families of planar(More)
  • 1