Informace o publikaci
On Strict (Outer-)Confluent Graphs
| Autoři | |
|---|---|
| Rok publikování | 2019 |
| Druh | Článek ve sborníku |
| Konference | Graph Drawing and Network Visualization - 27th International Symposium, GD 2019 |
| Fakulta / Pracoviště MU | |
| Citace | |
| www | https://link.springer.com/chapter/10.1007%2F978-3-030-35802-0_12 |
| Doi | http://dx.doi.org/10.1007/978-3-030-35802-0_12 |
| Klíčová slova | Parameterized Complexity |
| Popis | 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 (delta-)SOC graphs have bounded cliquewidth. |