On strict (outer-)confluent graphs
From MaRDI portal
Publication:2206846
DOI10.1007/978-3-030-35802-0_12OpenAlexW2989713409MaRDI QIDQ2206846
Henry Förster, Martin Nöllenburg, Robert Ganian, Fabian Klute
Publication date: 26 October 2020
Full work available at URL: https://arxiv.org/abs/1908.05345
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maximum weight independent sets and cliques in intersection graphs of filaments
- Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs
- Efficient parallel algorithms for doubly convex-bipartite graphs
- A game of cops and robbers
- Tolerance graphs
- Confluent layered drawings
- Train tracks and confluent drawings
- String graphs. I: The number of critical nonstring graphs is infinite
- Comparability graphs and intersection graphs
- Intersection graphs of curves in the plane
- Cops and robbers on intersection graphs
- Algorithmic graph theory and perfect graphs
- Linear time solvable optimization problems on graphs of bounded clique-width
- Upper bounds to the clique width of graphs
- Strict Confluent Drawing
- Alternation Graphs
- Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way
- Maximum Weight Clique Algorithms for Circular-Arc Graphs and Circle Graphs
- Linear-time computability of combinatorial problems on series-parallel graphs
- Approximation algorithms for NP-complete problems on planar graphs
- Recognizing circle graphs in polynomial time
- ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES
- Transitive Orientation of Graphs and Identification of Permutation Graphs
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
- More characterizations of triangulated graphs
- Confluent Hasse Diagrams
- Graph Drawing
