%0 Journal Article
%T ON THE UPPER EMBEDDABILITY OF THE PLANAR EMBEDDING OF GRAPHS<br>关于图的平面嵌入的一个上可嵌入性
%A Yuan Qiu HUANG
%A <br>黄元秋
%J 系统科学与数学
%D 1999
%I 
%X This paper shows that if a loopless graph G can be embedded in the planesuch that the degree of every face does not exceed 5, then G is upper embeddable, i.e., theconjecture posed by R. Nedela and M. Skoviera in 4] is proved to be true when the surface Sis the plane.
%K Graphs
%K degree of face
%K maximum genus
%K upper embeddable<br>图
%K 面的次
%K 最大亏格
%K 上可嵌入
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=6E709DC38FA1D09A4B578DD0906875B5B44D4D294832BB8E&cid=37F46C35E03B4B86&jid=0CD45CC5E994895A7F41A783D4235EC2&aid=6E526F0BBD3FC1B36AF68AE1247F5BF1&yid=B914830F5B1D1078&vid=2A8D03AD8076A2E3&iid=E158A972A605785F&sid=BFB86B6ED3A99B9D&eid=FED44C0135DC1D9C&journal_id=1000-0577&journal_name=系统科学与数学&referenced_num=4&reference_num=0