南京师大学报（自然科学版）2006，Vol.29Issue(1)：17-20,4.
独立数≤5的3-边连通简单图的上可嵌入性
Upper Embeddability of 3-Edge-Connected Simple Graphs with Independence-Number≤5
摘要
Abstract
Combined with the edge-connectivity, this paper investigates the relationship between the independencenumber and the upper-embeddability of a 3-edge-connected simple graph and obtains the following result: Let G be a 3-edge-connected simple graph with α(G) ≤5 (where α(G) is the independence-number of G) , then G is upper embeddable, and two minimal examples are given in the sense that there are 3-edge-connected graphs which are not upper embeddable.关键词
图/最大亏格/Betti亏数/上可嵌入的/独立数Key words
graph/maximum genus/betti deficiency/upper embeddable/independence-number分类
数理科学引用本文复制引用
高岩波,任韩..独立数≤5的3-边连通简单图的上可嵌入性[J].南京师大学报（自然科学版）,2006,29(1):17-20,4.基金项目
Supported by the National Natural Science Foundation of China (10271048) and Shanghai Priority Academic Discipline and Science and Technology Commission of Shanghai Municipality (04JC14031). （10271048）
