The maximum genus of a 3-regular simplicial graph

被引:0
|
作者
Deming L. [1 ,2 ]
Yanpei L. [1 ,2 ]
机构
[1] Dept. of Math., Capital Normal Univ., Beijing
[2] Dept. of Math., Northern Jiaotong Univ., Beijing
关键词
Girth; Graph; Independent number; Surface;
D O I
10.1007/s11766-999-0027-9
中图分类号
学科分类号
摘要
In this paper, the relationship between non-separating independent number and the maximum genus of a 3-regular simplicial graph is presented. A lower bound on the maximum genus of a 3-regular graph involving girth is provided. The lower bound is tight, it improves a bound of Huang and Liu. © 1999, Springer Verlag. All rights reserved.
引用
收藏
页码:203 / 214
页数:11
相关论文
共 50 条