On minimally 3-connected graphs on a surface

It is well-known that the maximal size of minimally 3-connected graphs of order 7n is 93 -n . In this paper, we shall prove that if G is a minimally 3-connected graph of order n, and is embedded in a closed surface with Euler characteristic , then G contains at most }2,2min{2 -n edges. This bound is best possible for every closed surface.

• Type: Journal
• Year: 2002
• Where: ENDM
• Authors: Katsuhiro Ota
• Keywords: 3-connected Graph, Closed Surface, ENDM 2002, Maximal Size