Lower bound number of irreducible graphs on surfaces

被引:1
|
作者
Liu, Y [1 ]
Liu, YP [1 ]
机构
[1] No Jiaotong Univ, Dept Math, Beijing 100044, Peoples R China
关键词
irreducible graph; surface; genus; embedding;
D O I
10.1016/S0252-9602(17)30722-1
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Irreducible graphs are those graphs which can not be embedded on some surface but deleting any edge of this graph, the resultant graph can be embedded on the surface. This paper characterizes one kind of irreducible graphs and it is shown that the lower bound number of irreducible graphs for the surface of genus it is 2 x 16(n).
引用
收藏
页码:333 / 339
页数:7
相关论文
共 50 条