Planarity of the 2-Level Cactus Model.
WG '01: Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science(2001)
摘要
The 2-level cactus introduced by Dinitz and Nutov in [5] is a data structure that represents the minimum and minimum+1 edgecuts of an undirected connected multi-graph G in a compact way. In this paper, we study planarity of the 2-level cactus, which can be used, e.g., in graph drawing. We give a new sufficient planarity criterion in terms of projection paths over a spanning subtree of a graph. Using this criterion, we show that the 2-level cactus of G is planar if the cardinality of a minimum edge-cut of G is not equal to 2, 3 or 5. On the other hand, we give examples for non-planar 2-level cacti of graphs with these connectivities.
更多查看译文
关键词
2-level cactus,minimum edge-cut,graph drawing,new sufficient planarity criterion,data structure,projection path,undirected connected multi-graph,2-Level Cactus Model
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络