A TIGHT LOWER BOUND ON THE MAXIMUM GENUS OF A 3-CONNECTED LOOPLESS MULTIGRAPH

被引：0
|
作者：
Li Deming Liu YanpeiDept.of Math.
机构：
来源：
AppliedMathematics:AJournalofChineseUniversities | 2000年 / 04期
关键词：
Maximum genus; graph; connectivity;
D O I：
暂无
中图分类号：
O157.5 [图论];
学科分类号：
摘要：
It is proved that every 3 connected loopless multigraph has maximum genus at least one third of its cycle rank plus one if its cycle rank is not less than ten, and if its cycle rank is less than ten,it is upper embeddable.This lower bound is tight.There are infinitely many 3 connected loopless multigraphs attaining this bound.
引用
收藏
页码：369 / 376
页数：8
相关论文
共 34 条
1234