Acta mathematica scientia,Series B ›› 1998, Vol. 18 ›› Issue (3): 333-339.

• Articles • Previous Articles     Next Articles

LOWER BOUND NUMBER OF IRREDUCIBLE GRAPHS ON SURMCES

Liu Ying, Liu Yanpei   

  1. Department of Mathematics, Northern Jiaotong University, Beijing 100044, China
  • Received:1996-09-02 Online:1998-09-25 Published:1998-09-25
  • Supported by:
    Supported by NNSF in China under grant No. 19136014

Abstract: 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.

Key words: irreducible graph, surface, genus, embedding

Trendmd