摘要
Irreducible graphs are those graphs which can hot be embedded on some surface but deleting ally 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 n is 2 × 16n.
Irreducible graphs are those graphs which can hot be embedded on some surface but deleting ally 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 n is 2 × 16n.
