On strict (outer-)confluent graphs

DOI10.1007/978-3-030-35802-0_12MaRDI QIDQ2206846zbMATH OpenOpenAlexFDO

Authors Henry Förster, Robert Ganian, Fabian Klute, Martin Nöllenburg

Publication date 26 October 2020

Full work available at URL https://arxiv.org/abs/1908.05345

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• On strict (outer-)confluent graphs
• Strict confluent drawing
• Strict Confluent Drawing
• Graph Drawing

Cites work

• scientific article; zbMATH DE number 4063153 (Why is no real title available?)
• scientific article; zbMATH DE number 53952 (Why is no real title available?)
• scientific article; zbMATH DE number 3307330 (Why is no real title available?)
• A game of cops and robbers
• Algorithmic graph theory and perfect graphs
• Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
• Alternation graphs
• Approximation algorithms for NP-complete problems on planar graphs
• Comparability graphs and intersection graphs
• Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way
• Confluent Hasse diagrams
• Confluent layered drawings
• Efficient parallel algorithms for doubly convex-bipartite graphs
• Graph Drawing
• Intersection graphs of curves in the plane
• Linear time solvable optimization problems on graphs of bounded clique-width
• Linear-time computability of combinatorial problems on series-parallel graphs
• Maximum Weight Clique Algorithms for Circular-Arc Graphs and Circle Graphs
• Maximum weight independent sets and cliques in intersection graphs of filaments
• More characterizations of triangulated graphs
• On the clique-width of some perfect graph classes
• Recognizing circle graphs in polynomial time
• Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs
• Strict Confluent Drawing
• String graphs. I: The number of critical nonstring graphs is infinite
• Tolerance graphs
• Train tracks and confluent drawings
• Transitive Orientation of Graphs and Identification of Permutation Graphs
• Upper bounds to the clique width of graphs

Cited in

(4)

• Crossing Layout in Non-planar Graph Drawings
• Strict refinement for graphs and digraphs
• Approximating the Bundled Crossing Number
• On Strict (Outer-)Confluent Graphs

This page was built for publication: On strict (outer-)confluent graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2206846)