Boolean Approach to Planar Embeddings of a Graph

被引：0
|
作者：
刘彦佩
机构：
[1] The permanent address: Institute of Applied Mathematics, Academia Sinica, Beijing, China 100080
[2] RUTCOR, Rutgers University, USA
来源：
Acta Mathematica Sinica,English Series | 1989年 / 01期
基金：
中国国家自然科学基金; 美国国家科学基金会;
关键词：
der; tree; Boolean Approach to Planar Embeddings of a Graph;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
The purpse of this paper which is a sequel of "Boolean planarity characterization ofgraphs" is to show the following results. (1) Both of the problems of testing the planarity of graphs and embedding a planar graph into theplane are equivalent to finding a spanning tree in another graph whose order and sise are bounded by alinear function of the order and the size of the original graph, respectively. (2) The number of topologically non-equivalent planar embeddings of a Hamiltonian planar graphG is τ(G)=2~(c(H)-1),where c(H)is the number of the components of the graph H which is related to G.
引用
收藏
页码：64 / 79
页数：16
相关论文
共 50 条
  • [1] Boolean Approach to Planar Embeddings of a Graph
    刘彦佩
    Acta Mathematica Sinica, 1989, (01) : 64 - 79
  • [2] On simultaneous planar graph embeddings
    Brass, Peter
    Cenek, Eowyn
    Duncan, Cristian A.
    Efrat, Alon
    Erten, Cesim
    Ismailescu, Dan P.
    Kobourov, Stephen G.
    Lubiw, Anna
    Mitchell, Joseph S. B.
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2007, 36 (02): : 117 - 130
  • [3] On simultaneous planar graph embeddings
    Brass, P
    Cenek, E
    Duncan, CA
    Efrat, A
    Erten, C
    Ismailescu, D
    Kobourov, SG
    Lubiw, A
    Mitchell, JSB
    ALGORITHMS AND DATA STRUCTURES, PROCEEDINGS, 2003, 2748 : 243 - 255
  • [4] Boolean approaches to graph embeddings related to VLSI
    刘彦佩
    ScienceinChina,SerA., 2001, Ser.A.2001 (08) : 1034 - 1041
  • [5] Boolean approaches to graph embeddings related to VLSI
    Yanpei Liu
    Science in China Series A: Mathematics, 2001, 44 : 1034 - 1041
  • [6] Boolean approaches to graph embeddings related to VLSI
    Liu, YP
    SCIENCE IN CHINA SERIES A-MATHEMATICS PHYSICS ASTRONOMY, 2001, 44 (08): : 1034 - 1041
  • [7] Boolean approaches to graph embeddings related to VLSI
    刘彦佩
    Science China Mathematics, 2001, (08) : 1034 - 1041
  • [8] Plane Embeddings of Planar Graph Metrics
    MohammadHossein Bateni
    Erik D. Demaine
    MohammadTaghi Hajiaghayi
    Mohammad Moharrami
    Discrete & Computational Geometry, 2007, 38 : 615 - 637
  • [9] Plane embeddings of planar graph metrics
    Bateni, Mohammad Hossein
    Demaine, Erik D.
    Hajiaghayi, Mohammad Taghi
    Moharrami, Mohammad
    DISCRETE & COMPUTATIONAL GEOMETRY, 2007, 38 (03) : 615 - 637
  • [10] Optimizing over all combinatorial embeddings of a planar graph
    Mutzel, P
    Weiskircher, R
    INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, 1999, 1610 : 361 - 376
12345