H. Förster, R. Ganian, F. Klute, M. Nöllenburg:

"On Strict (Outer-)Confluent Graphs";

Talk: International Symposium on Graph Drawing and Network Visualization (GD), Prag; 2019-09-17 - 2019-09-20; in: "GD 2019: Graph Drawing and Network Visualization", LNCS, 11904 (2019), ISBN: 978-3-030-35801-3; 147 - 161.

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.

http://dx.doi.org/10.1007/978-3-030-35802-0_12

https://publik.tuwien.ac.at/files/publik_284620.pdf

Created from the Publication Database of the Vienna University of Technology.