A Note on Obstructions to Clustered Planarity

被引：0
|
作者：
Sneddon, Jamie [1 ]
Bonnington, Paul [2 ]
机构：
[1] Univ Auckland, Dept Math, Auckland, New Zealand
[2] Monash Univ, Monash E Res Ctr, Melbourne, Vic 3004, Australia
来源：
ELECTRONIC JOURNAL OF COMBINATORICS | 2011年 / 18卷 / 01期
关键词：
DIGRAPHS;
D O I：
暂无
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
A planar digraph D is clustered planar if in some planar embedding of D we have at each vertex the in-arcs occurring sequentially in the local rotation. By supplementing the operations used to form the usual minors in Kuratowski's theorem, clustered planar digraphs are characterised.
引用
收藏
页数：6
相关论文
共 50 条
  • [1] Clustered Planarity = Flat Clustered Planarity
    Cortese, Pier Francesco
    Patrignani, Maurizio
    [J]. GRAPH DRAWING AND NETWORK VISUALIZATION, GD 2018, 2018, 11282 : 23 - 38
  • [2] Clustered Planarity with Pipes
    Patrizio Angelini
    Giordano Da Lozzo
    [J]. Algorithmica, 2019, 81 : 2484 - 2526
  • [3] Clustered level planarity
    Forster, M
    Bachmaier, C
    [J]. SOFSEM 2004: THEORY AND PRACTICE OF COMPUTER SCIENCE, PROCEEDINGS, 2004, 2932 : 218 - 228
  • [4] Clustered Planarity with Pipes
    Angelini, Patrizio
    Da Lozzo, Giordano
    [J]. ALGORITHMICA, 2019, 81 (06) : 2484 - 2526
  • [5] Clustered Planarity Testing Revisited
    Fulek, Radoslav
    Kyncl, Jan
    Malinovic, Igor
    Palvoelgyi, Domotor
    [J]. GRAPH DRAWING (GD 2014), 2014, 8871 : 428 - 439
  • [6] Relaxing the constraints of clustered planarity
    Angelini, Patrizio
    Da Lozzo, Giordano
    Di Battista, Giuseppe
    Frati, Fabrizio
    Patrignani, Maurizio
    Roselli, Vincenzo
    [J]. COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2015, 48 (02): : 42 - 75
  • [7] Clustered planarity testing revisited
    Fulek, Radoslav
    Kyncl, Jan
    Malinovic, Igor
    Palvoelgyi, Doemoetoer
    [J]. ELECTRONIC JOURNAL OF COMBINATORICS, 2015, 22 (04):
  • [8] Atomic Embeddability, Clustered Planarity, and Thickenability
    Fulek, Radoslav
    Toth, Csaba D.
    [J]. PROCEEDINGS OF THE THIRTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA'20), 2020, : 2876 - 2895
  • [9] Atomic Embeddability, Clustered Planarity, and Thickenability
    Fulek, Radoslav
    Toth, Csaba D.
    [J]. PROCEEDINGS OF THE 2020 ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2020, : 2876 - 2895
  • [10] Atomic Embeddability, Clustered Planarity, and Thickenability
    Fulek, Radoslav
    Toth, Csaba D.
    [J]. JOURNAL OF THE ACM, 2022, 69 (02)
12345