您当前所在位置: 首页 > 学者

黄元秋

  • 42浏览

  • 0点赞

  • 0收藏

  • 0分享

  • 86下载

  • 0评论

  • 引用

期刊论文

Face Size and the Maximum Genus of a Graph 1. Simple Graphs1

黄元秋Yuanqiu Huang Yanpei Liu

Journal of Combinatorial Theory, Series B 80(2000)356-370 ,-0001,():

URL:

摘要/描述

This paper shows that a simple graph which can be cellularly embedded on some closed surface in such a way that the size of each face does not exceed 7 is upper embeddable. This settles one of two conjectures posed by Nedela and S8 koviera (1990, in "Topics in Combinatorics and Graph Theory," pp. 519-529, Physica Verlag, Heidelberg). The other conjecture will be proved in a sequel to this paper.

关键词:

版权说明:以下全部内容由黄元秋上传于   2009年09月27日 11时15分07秒,版权归本人所有。

我要评论

全部评论 0

本学者其他成果

    同领域成果