提示
黄元秋
-
64浏览
-
0点赞
-
0收藏
-
0分享
-
86下载
-
0评论
-
引用
期刊论文
Face Size and the Maximum Genus of a Graph 1. Simple Graphs1
Journal of Combinatorial Theory, Series B 80(2000)356-370 ，-0001，（）：
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秒]，版权归原创者所有。本文仅代表作者本人观点，与本网站无关。本网站对文中陈述、观点判断保持中立，不对所包含内容的准确性、可靠性或完整性提供任何明示或暗示的保证。请读者仅作参考，并请自行承担全部责任。
本学者其他成果
同领域成果
