Constrained outer-string representations

DOI10.4230/LIPICS.GD.2024.10MaRDI QIDQ6920473zbMATH OpenFDO

Authors Therese Biedl, Sabine Cornelsen, Jan Kratochvíl, Ignaz Rutter

Publication date 7 October 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.GD.2024.10

zbMATH Keywords

chordal graphscomputational complexityouter-1-stringouter-stringpolynomial-time algorithmsstring representationtrees

Mathematics Subject Classification ID

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

Cites work

• Grounded \(\mathrm{L}\)-graphs are polynomially \(\chi \)-bounded
• scientific article; zbMATH DE number 3838075 (Why is no real title available?)
• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• Intersection graphs of curves in the plane
• Intersection graphs of pseudosegments: chordal graphs
• On bounding the chromatic number of L-graphs
• On grounded -graphs and their relatives
• On rigid circuit graphs
• On the size of outer-string representations
• Order-preserving 1-string representations of planar graphs
• Outerstring graphs are -bounded
• Representations of chordal graphs as subtrees of a tree
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• The max clique problem in classes of string-graphs
• Topology of Thin Film RC Circuits
• Triangle-free intersection graphs of line segments with large chromatic number

Cited in

(1)

• Constrained outer-string representations

This page was built for publication: Constrained outer-string representations

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