On L-shaped point set embeddings of trees: first non-embeddable examples
From MaRDI portal
Recommendations
- On L-shaped point set embeddings of trees: first non-embeddable examples
- Point-set embeddings of trees with given partial drawings
- Planar embedding of trees on point sets without the general position assumption
- Point-Set Embedding of Trees with Edge Constraints
- Point-set embeddings of plane 3-trees
- Planar straight-line point-set embedding of trees with partial embeddings
- Point-set embeddings of plane 3-trees (extended abstract)
- Bichromatic point-set embeddings of trees with fewer bends (extended abstract)
- Point-set embeddability of 2-colored trees
- Upward point set embeddings of paths and trees
Cites work
- scientific article; zbMATH DE number 5510691 (Why is no real title available?)
- Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles
- Geometric graphs in the plane lattice
- Improved bounds for drawing trees on fixed points with L-shaped edges
- Manhattan-geodesic embedding of planar graphs
- On L-shaped point set embeddings of trees: first non-embeddable examples
- Orthogeodesic point-set embedding of trees
Cited in
(8)- Improved bounds for drawing trees on fixed points with L-shaped edges
- Planar straight-line point-set embedding of trees with partial embeddings
- Orthogeodesic point-set embedding of trees
- On L-shaped point set embeddings of trees: first non-embeddable examples
- Rollercoasters: Long Sequences without Short Runs
- On L-shaped point set embeddings of trees: first non-embeddable examples
- On L-shaped point set embeddings of trees: first non-embeddable examples
- \(L\)-shaped point set embeddings of high-degree plane graphs
This page was built for publication: On L-shaped point set embeddings of trees: first non-embeddable examples
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1725769)
