The widths of strict outerconfluent graphs

DOI10.46298/DMTCS.12862MaRDI QIDQ6986981zbMATH OpenFDO

Authors David Eppstein

Publication date 7 May 2025

Published in Discrete Mathematics and Theoretical Computer Science. DMTCS (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

clique-widthtwin-widthconfluent graph drawing

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites work

• scientific article; zbMATH DE number 1696534 (Why is no real title available?)
• Approximating clique-width and branch-width
• Approximating highly inapproximable problems on graphs of bounded twin-width
• Biclique Edge Cover Graphs and Confluent Drawings
• Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way
• Confluent Hasse diagrams
• Confluent Orthogonal Drawings of Syntax Diagrams
• Confluent drawing algorithms using rectangular dualization
• Confluent layered drawings
• Graph Drawing
• Linear time solvable optimization problems on graphs of bounded clique-width
• On strict (outer-)confluent graphs
• On the enumeration of interval graphs
• On the succinct representation of graphs
• Planar confluent orthogonal drawings of 4-modal digraphs
• Planar decompositions and the crossing number of graphs with an excluded minor
• Strict Confluent Drawing
• Train tracks and confluent drawings
• Twin-width IV: ordered graphs and matrices
• Twin-width. I: Tractable FO model checking
• Twin-width. II: Small classes

Cited in

(1)

• Computing twin-width parameterized by the feedback edge number and vertex integrity

This page was built for publication: The widths of strict outerconfluent graphs

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