학술논문
On Strict (Outer-)Confluent Graphs
Document Type
Chapter
Author
Goos, Gerhard, Founding Editor; Hartmanis, Juris, Founding Editor; Bertino, Elisa, Editorial Board Member; Gao, Wen, Editorial Board Member; Steffen, Bernhard, Editorial Board Member; Woeginger, Gerhard, Editorial Board Member; Yung, Moti, Editorial Board Member; Archambault, Daniel, Editor; Tóth, Csaba D., Editor; Förster, Henry; Ganian, Robert; Klute, Fabian; Nöllenburg, Martin
Source
Graph Drawing and Network Visualization : 27th International Symposium, GD 2019, Prague, Czech Republic, September 17–20, 2019, Proceedings. 11/28/2019. 11904:147-161
Subject
Language
English
ISSN
0302-9743
1611-3349
1611-3349
Abstract
A strict confluent (SC) graph drawing is a drawing of a graph with vertices as points in the plane, where vertex adjacencies are represented not by individual curves but rather by unique smooth paths through a planar system of junctions and arcs. If all vertices of the graph lie in the outer face of the drawing, the drawing is called a strict outerconfluent (SOC) drawing. SC and SOC graphs were first considered by Eppstein et al. in Graph Drawing 2013. Here, we establish several new relationships between the class of SC graphs and other graph classes, in particular string graphs and unit-interval graphs. Further, we extend earlier results about special bipartite graph classes to the notion of strict outerconfluency, show that SOC graphs have cop number two, and establish that tree-like ($$\varDelta $$