Weak embedding of planar graphs

被引：0
作者：
Erling W. [1 ,2 ]
Yanpei L. [3 ,4 ]
机构：
[1] Department of Mathematics, Renmin University of China
[2] Institute of Mathematics, Beijing Jiaotong University
来源：
Journal of Applied Mathematics and Computing | 2006年 / 21卷 / 1-2期
关键词：
Double cover; Embedding; Genus;
D O I：
10.1007/BF02896396
中图分类号：
学科分类号：
摘要：
A weak embedding of a graph G is an embedding of G with all the faces being tours. In this paper, for some planar graphs the weak maximum genus of them are given. And for the planar graph G, a characterization of whether G can be weakly embedded on the nonspherical surfaces is obtained. © 2006 Korean Society for Computational & Applied Mathematics and Korean SIGCAM.
引用
收藏
页码：175 / 187
页数：12
相关论文
共 11 条
  • [1] Liu T. Y.(2002)Strong embeddings of planar graphs on higher surfaces Acta Mathematica Scientia 22 542-548
  • [2] Liu Y. P.(2000)New approaches to the double cover conjecture of graphs by circuits OR Transactions 4 50-54
  • [3] Richter R. B.(1994)Circular embedding of Planar graphs in nonspherical surfaces Discrete Mathematics 126 273-280
  • [4] Seymour P. D.(1973)Polyhedral decomposition of cubic graphs Bull. Austral. Math. Soc. 8 367-387
  • [5] Sirán J.(2003)Maximum genus of strong embeddings Acta Mathematicae Applicatae Sinica 19 437-446
  • [6] Szekeres G.(2004)Strong maximum genus of planar Halin graphs OR Transaction 8 35-40
  • [7] Wei E. R.(undefined)undefined undefined undefined undefined-undefined
  • [8] Liu Y. P.(undefined)undefined undefined undefined undefined-undefined
  • [9] Ren H.(undefined)undefined undefined undefined undefined-undefined
  • [10] Wei E. R.(undefined)undefined undefined undefined undefined-undefined
12