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

来源：

ACTA MATHEMATICA SCIENTIA | 1998年 / 18卷 / 03期

关键词：

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

共 6 条

[1]

AUSLANDER L, 1963, J MATH MECH, V129, P629

[2]

Decker R., 1978, THESIS OHIO STATE U

[3] 103 GRAPHS THAT ARE IRREDUCIBLE FOR THE PROJECTIVE PLANE [J].

GLOVER, HH ;

HUNEKE, JP ;

WANG, CS .

JOURNAL OF COMBINATORIAL THEORY SERIES B, 1979, 27 (03) :332-370

[4]

LIU Y, 1995, SOME IRREDUCIBLE GRA

[5]

Liu Y. P., 1995, EMBEDDABILITY GRAPHS

[6] GRAPH MINORS .8. A KURATOWSKI THEOREM FOR GENERAL SURFACES [J].

ROBERTSON, N ;

SEYMOUR, PD .

JOURNAL OF COMBINATORIAL THEORY SERIES B, 1990, 48 (02) :255-288

← 1 →