Bar 1-visibility graphs and their relation to other nearly planar graphs

被引：15
|
作者：
Evans, William [1 ]
Kaufmann, Michael [2 ]
Lenhart, William [3 ]
McHedlidze, Tamara [4 ]
Wismath, Stephen [5 ]
机构：
[1] University of British Columbia, Canada
[2] Universität Tübingen, Germany
[3] Williams College, United States
[4] Karlsruhe Institute of Technology, Germany
[5] University of Lethbridge, Canada
来源：
Journal of Graph Algorithms and Applications | 2014年 / 18卷 / 05期
关键词：
30;
D O I：
10.7155/jgaa.00343
中图分类号：
学科分类号：
摘要：
引用
收藏
页码：721 / 739
相关论文
共 50 条
  • [31] Bar κ-visibility graphs:: Bounds on the number of edges, chromatic number, and thickness
    Dean, AM
    Evans, W
    Gethner, E
    Laison, JD
    Safari, MA
    Trotter, WT
    GRAPH DRAWING, 2006, 3843 : 73 - 82
  • [32] Optimal 1-planar graphs which triangulate other surfaces
    Suzuki, Yusuke
    DISCRETE MATHEMATICS, 2010, 310 (01) : 6 - 11
  • [33] Upper bounds for bar visibility of subgraphs and n-vertex graphs
    Feng, Yuanrui
    West, Douglas B.
    Yang, Yan
    DISCRETE APPLIED MATHEMATICS, 2020, 283 : 272 - 274
  • [34] Fan-crossing free graphs and their relationship to other beyond-planar graphs
    Brandenburg, Franz J.
    THEORETICAL COMPUTER SCIENCE, 2021, 867 : 85 - 100
  • [35] Joins of 1-Planar Graphs
    Július CZAP
    Dvid HUDK
    Tom MADARAS
    ActaMathematicaSinica(EnglishSeries), 2014, 30 (11) : 1867 - 1876
  • [36] A note on 1-planar graphs
    Ackerman, Eyal
    DISCRETE APPLIED MATHEMATICS, 2014, 175 : 104 - 108
  • [37] Planar graphs are in 1-STRING
    Chalopin, J.
    Goncalves, D.
    Ochem, P.
    PROCEEDINGS OF THE EIGHTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2007, : 609 - 617
  • [38] The structure of 1-planar graphs
    Fabrici, Igor
    Madaras, Tomas
    DISCRETE MATHEMATICS, 2007, 307 (7-8) : 854 - 865
  • [39] Joins of 1-planar graphs
    Július Czap
    Dávid Hudák
    Tomáš Madaras
    Acta Mathematica Sinica, English Series, 2014, 30 : 1867 - 1876
  • [40] Outer 1-Planar Graphs
    Auer, Christopher
    Bachmaier, Christian
    Brandenburg, Franz J.
    Gleissner, Andreas
    Hanauer, Kathrin
    Neuwirth, Daniel
    Reislhuber, Josef
    ALGORITHMICA, 2016, 74 (04) : 1293 - 1320
12345