| 最大面次为6图的上可嵌入性 |
| |
| 引用本文： | 柴钊,刘彦佩. 最大面次为6图的上可嵌入性[J]. 北京交通大学学报(自然科学版), 2005, 29(6): 94-97 |
| |
| 作者姓名： | 柴钊 刘彦佩 |
| |
| 作者单位： | 北京交通大学,理学院,北京,100044;北京交通大学,理学院,北京,100044 |
| |
| 摘 要： | 给出一类最大面次为6的图的集合Φ,证明对于任何一个无环图G(E)Φ,如果它能嵌入在平面上使得每个面次不超过6,则G是上可嵌入的.进而,确定了集合Φ中图的构作.
|
| 关 键 词： | 图论 面次 上可嵌入 最大亏格 |
| 文章编号： | 1673-0291(2005)06-0094-04 |
| 收稿时间： | 2004-11-10 |
| 修稿时间： | 2004-11-10 |
Upper Embedability of Graphs Whose Maximal Degree of Every Face Is 6 |
| |
| CHAI Zhao,LIU Yan-pei. Upper Embedability of Graphs Whose Maximal Degree of Every Face Is 6[J]. JOURNAL OF BEIJING JIAOTONG UNIVERSITY, 2005, 29(6): 94-97 |
| |
| Authors: | CHAI Zhao LIU Yan-pei |
| |
| Affiliation: | School of Sciences, Beijing Jiaotong University, Beijing 100044,China |
| |
| Abstract: | This paper gives a kind of group set whose maximal degree of every face is 6. And proves that if any loopless graph can be embeded in the plane and the degree of every face does not exceed 6, then G is upper embedable. And further constructs the graphs which belong to. |
| |
| Keywords: | graphs degree of face upper embedable maximum genus |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
