Using the embedding character of a graph which can be cellularly embedded on some closed surface,especially the size of faces,this paper studies the lower bounds on the maximum genus of a graph.
英
美
- 利用图在曲面上的嵌入特征,特别是面的度的大小,研究图的最大亏格的下界。