Upper-embedding of a near-triangulation graph
Chang-Qing Lv · Journal of Qiqihar University · 2008
In this paper,we consider upper-embedding of near-triangulation graphs,where near-triangulation plane graph is a plane graph whose facial cycles are 3-cycle except one.Kundu show that if the geometric dual G* of a near-triangulation plane graph G contains a set of [1/2φ] independent edges,then the maximum genus γ M(G) of G is at least [β(G)2]-1.In this paper we conclude one kind of near-triangulation graphs without G0 is upper-embedding.