Notice
This item was automatically migrated from a legacy system. It's data has not been checked and might not meet the quality criteria of the present system.
Förster, H., Ganian, R., Klute, F., & Nöllenburg, M. (2021). On Strict (Outer-)Confluent Graphs. Journal of Graph Algorithms and Applications, 25(1), 481–512. https://doi.org/10.7155/jgaa.00568
E192-01 - Forschungsbereich Algorithms and Complexity
-
Journal:
Journal of Graph Algorithms and Applications
-
ISSN:
1526-1719
-
Date (published):
2021
-
Number of Pages:
32
-
Peer reviewed:
Yes
-
Keywords:
Computer Science Applications; Theoretical Computer Science; General Computer Science; Computational Theory and Mathematics; Geometry and Topology
-
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 wer...
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 (Δ-)SOC graphs have bounded cliquewidth.
