No-bend orthogonal drawings of subdivisions of planar triconnected cubic graphs

被引：0
|
作者：
Rahman, MS [1 ]
Egi, N [1 ]
Nishizeki, T [1 ]
机构：
[1] Tohoku Univ, Grad Sch Informat Sci, Sendai, Miyagi 9808579, Japan
来源：
GRAPH DRAWING | 2004年 / 2912卷
关键词：
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
A plane graph is a planar graph with a fixed embedding. In a no-bend orthogonal drawing of a plane graph, each vertex is drawn as a point and each edge is drawn as a single horizontal or vertical line segment. A planar graph is said to have a no-bend orthogonal drawing if at least one of its plane embeddings has a no-bend orthogonal drawing. In this paper we consider a class of planar graphs, called subdividions of planar triconnected cubic graphs, and give a linear-time algorithm to examine whether such a planar graph G has a no-bend orthogonal drawing and to find one if G has.
引用
收藏
页码：387 / 392
页数：6
相关论文
共 50 条
  • [21] Optimal Orthogonal Drawings of Planar 3-Graphs in Linear Time
    Didimo, Walter
    Liotta, Giuseppe
    Ortali, Giacomo
    Patrignani, Maurizio
    PROCEEDINGS OF THE THIRTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA'20), 2020, : 806 - 825
  • [22] Optimal Orthogonal Drawings of Planar 3-Graphs in Linear Time
    Didimo, Walter
    Liotta, Giuseppe
    Ortali, Giacomo
    Patrignani, Maurizio
    PROCEEDINGS OF THE 2020 ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2020, : 806 - 825
  • [23] Convex Grid Drawings of Internally Triconnected Plane Graphs with Pentagonal Contours
    Miura, Kazuyuki
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2023, E106A (09) : 1099 - 1099
  • [24] Non-planar extensions of subdivisions of planar graphs
    Norin, Sergey
    Thomas, Robin
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2016, 121 : 326 - 366
  • [25] The Quality Ratio of RAC Drawings and Planar Drawings of Planar Graphs
    van Kreveld, Marc
    GRAPH DRAWING, 2011, 6502 : 371 - 376
  • [26] Computing Bend-Minimum Orthogonal Drawings of Plane Series–Parallel Graphs in Linear Time
    Walter Didimo
    Michael Kaufmann
    Giuseppe Liotta
    Giacomo Ortali
    Algorithmica, 2023, 85 : 2605 - 2666
  • [27] Packing Chromatic Number of Subdivisions of Cubic Graphs
    József Balogh
    Alexandr Kostochka
    Xujun Liu
    Graphs and Combinatorics, 2019, 35 : 513 - 537
  • [28] CONVEX DRAWINGS OF INTERNALLY TRICONNECTED PLANE GRAPHS ON O(n(2)) GRIDS
    Zhou, Xiao
    Nishizeki, Takao
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2010, 2 (03) : 347 - 362
  • [29] Packing Chromatic Number of Subdivisions of Cubic Graphs
    Balogh, Jozsef
    Kostochka, Alexandr
    Liu, Xujun
    GRAPHS AND COMBINATORICS, 2019, 35 (02) : 513 - 537
  • [30] Planar drawings of plane graphs
    Nakano, S
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2000, E83D (03) : 384 - 391
12345