Some new classes of upper embeddable graphs

被引：0

作者：

Liu, Duanfeng ^{[1
,2
]}

Liu, Xinru ^{[1
]}

机构：

[1] Central S Univ, Dept Math Sci & Comp Technol, Changsha 410083, Hunan, Peoples R China

[2] Guangdong Univ Technol, Dept Appl Math, Guangzhou 510006, Guangdong, Peoples R China

来源：

ARS COMBINATORIA | 2010年 / 96卷

关键词：

Degree; maximum genus; upper embeddable; MAXIMUM GENUS;

D O I：

暂无

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Combining with specific degrees or edges of a graph, this paper provides some new classes of upper embeddable graphs and extends the results in [Y. Huang,Y. Liu, Some classes of upper embeddable graphs, Acta Mathematica Scientia,1997,17(Supp.): 154-161].

引用

页码：221 / 231

页数：11

共 12 条

[1]

Huang Y., 2000, ACTA MATH SCI, V20

[2]

HUANG Y, 1997, ACTA MATH SCI S, V17, P154

[3]

Huang Y. Q., 1998, MATH APPL, P109

[4]

JUNGERMAN M, 1978, T AM MATH SOC, V241, P401

[5]

Kundu S., 1974, J COMB THEORY B, V17, P199

[6]

LIU Y, 1995, EMBEDDABILITY GRAPH

[7] EVERY CONNECTED, LOCALLY CONNECTED GRAPH IS UPPER EMBEDDABLE [J].

NEBESKY, L .

JOURNAL OF GRAPH THEORY, 1981, 5 (02) :205-207

[8]

NEBESKY L, 1981, CZECH MATH J, V31, P604

[9]

NORDHAUS EA, 1971, J COMB THEORY, V11, P285

[10]

RINGEISEN R, 1970, THESIS MICHIGAN STAT

← 1 2 →