Monotone simultaneous embeddings of paths in d dimensions
From MaRDI portal
Publication:2961545
Abstract: We study the following problem: Given paths that share the same vertex set, is there a simultaneous geometric embedding of these paths such that each individual drawing is monotone in some direction? We prove that for any dimension , there is a set of paths that does not admit a monotone simultaneous geometric embedding.
Recommendations
Cites work
- Monotone drawings of graphs
- Monotone drawings of graphs with fixed embedding
- Monotone simultaneous embeddings of paths in \(d\) dimensions
- Monotone simultaneous embeddings of upward planar digraphs
- On a tree and a path with no geometric simultaneous embedding
- On monotone drawings of trees
- On simultaneous planar graph embeddings
- Planar and Quasi Planar Simultaneous Geometric Embedding
- Simultaneous Embedding of Planar Graphs with Few Bends
- Straight-line monotone grid drawings of series-parallel graphs
- Strongly monotone drawings of planar graphs
- Suballowable sequences and geometric permutations
Cited in
(6)- Monotone simultaneous embeddings of upward planar digraphs
- Monotone simultaneous paths embeddings in \(\mathbb{R}^d\)
- Monotone simultaneous embeddings of paths in \(d\) dimensions
- scientific article; zbMATH DE number 6136123 (Why is no real title available?)
- scientific article; zbMATH DE number 5551581 (Why is no real title available?)
- Relating graph thickness to planar layers and bend complexity
This page was built for publication: Monotone simultaneous embeddings of paths in \(d\) dimensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2961545)