3 citations · 3 across the 3 of their papers we have counts for
5 papers · 1 filter
How Much Work Does It Take To Straighten a Plane Graph Out?
Mihyun Kang, Mathias Schacht, Oleg Verbitsky
We prove that if one wants to make a plane graph drawing straight-line then in the worst case one has to move almost all vertices.
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…
The enumeration of planar graphs via Wick's theorem
Mihyun Kang, Martin Loebl
A seminal technique of theoretical physics called Wick's theorem interprets the Gaussian matrix integral of the products of the trace of powers of Hermitian matrices as the number…
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…
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,…