Showing math.COShow all
3 papers · 1 filter
math.CO2006
On the logical complexity of convex polygon dissections
Manuel Bodirsky, Mihyun Kang, Oleg Verbitsky
The logical depth of a graph is the minimum quantifier depth of a first order sentence defining up to isomorphism in the language of the adjacency and the equality relation…
math.CO2005
Enumeration and limit laws of series-parallel graphs
Manuel Bodirsky, Omer Gimenez, Mihyun Kang +1
We show that the number of labelled series-parallel graphs on vertices is asymptotically , where and are explicit computable cons…
math.CO2005
Enumeration of Unlabeled Outerplanar Graphs
Manuel Bodirsky, Eric Fusy, Mihyun Kang +1
We determine the exact and asymptotic number of unlabeled outerplanar graphs. The exact number g_n of unlabeled outerplanar graphs on n vertices can be computed in polynomial time,…