Planar linear arrangements of outerplanar graphs
From MaRDI portal
Recommendations
Cited in
(16)- Optimal one-page tree embeddings in linear time
- Rectilinear planar layouts and bipolar orientations of planar graphs
- On minimum cuts and the linear arrangement problem
- On enumerating algorithms of novel multiple leaf-distance granular regular \(\alpha\)-subtrees of trees
- Lower bounds for the minimum linear arrangement of a graph
- Minimum Linear Arrangement of Series-Parallel Graphs
- Lower and upper bounds for the linear arrangement problem on interval graphs
- Linear layouts in submodular systems
- Minimum linear arrangement of the Cartesian product of optimal order graph and path
- Outerplanarity of line graphs and iterated line graphs
- Generalized lantern relations and planar line arrangements
- Divide-and-conquer algorithms for graph-layout problems
- Bounds of the sum of edge lengths in linear arrangements of trees
- Algorithms for enumerating multiple leaf-distance granular regular \(\alpha\)-subtree of unicyclic and edge-disjoint bicyclic graphs
- When the line graphs of the unit, unitary and total graphs are planar and outerplanar
- Intersection representations of matrices by subtrees and unicycles on graphs
This page was built for publication: Planar linear arrangements of outerplanar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3778778)