ENUMERATION OF LABELED EULER GRAPHS WITH CUT VERTICES
Ying Jin, Jin Chang · Journal of Mathematics · 2000
This paper discusses the enumeration of labeled Euler graphs with k(k≥2) cut vertices distributed only on one 2 connected Euler graph. In this paper we give the exponential generating function for labeled Euler graphs having exactly n 2 connected Euler graphs and the k(k≥2) cut vertices distributed only on one 2 connected Euler graph.