On strict (outer-)confluent graphs

DOI10.7155/JGAA.00568MaRDI QIDQ5084690zbMATH OpenOpenAlexFDO

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

Publication date 28 June 2022

Published in Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.7155/jgaa.00568

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph representations (geometric and intersection representations, etc.) (05C62)

Recommendations

• Strict Confluent Drawing
• Strict confluent drawing
• Graph Drawing
• Train tracks and confluent drawings
• Graph Drawing

Cites work

• scientific article; zbMATH DE number 3145756 (Why is no real title available?)
• scientific article; zbMATH DE number 3152801 (Why is no real title available?)
• scientific article; zbMATH DE number 53952 (Why is no real title available?)
• scientific article; zbMATH DE number 1933269 (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
• Block crossings in storyline visualizations
• Bundled Crossings in Embedded Graphs
• Bundled crossings revisited
• Circle graph obstructions
• Comparability graphs and intersection graphs
• Computing storyline visualizations with few block crossings
• Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way
• Confluent Hasse diagrams
• Confluent layered drawings
• Covering and coloring polygon-circle graphs
• Distance-hereditary graphs
• Efficient parallel algorithms for doubly convex-bipartite graphs
• Graph Drawing
• Hereditary modular graphs
• 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
• On the cop number of a graph
• 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
• The Bundled Crossing Number
• Topology of series-parallel networks
• Train tracks and confluent drawings
• Transitiv orientierbare Graphen
• Transitive Orientation of Graphs and Identification of Permutation Graphs
• Trapezoid graphs and generalizations, geometry and algorithms
• Trapezoid graphs and their coloring
• Upper bounds to the clique width of graphs
• Vertex-to-vertex pursuit in a graph

Cited in

(3)

• On strict (outer-)confluent graphs
• Strict confluent drawing
• Strict refinement for graphs and digraphs

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 Q5084690)