On a tree and a path with no geometric simultaneous embedding

DOI10.7155/JGAA.00250MaRDI QIDQ3112624zbMATH OpenOpenAlexFDO

Authors Patrizio Angelini, Markus Geyer, Michael Kaufmann, Daniel Neuwirth

Publication date 12 January 2012

Published in Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.7155/jgaa.00250

zbMATH Keywords

geometric simultaneous embeddingpathplanar straight line embeddingtree

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38) Graph representations (geometric and intersection representations, etc.) (05C62) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• On a tree and a path with no geometric simultaneous embedding
• Geometric simultaneous embeddings of a graph and a matching
• Geometric simultaneous embeddings of a graph and a matching
• Simultaneous Embedding of Planar Graphs with Few Bends
• Constrained simultaneous and near-simultaneous embeddings

Cited in

(13)

• The QuaSEFE problem
• On the curve complexity of 3-colored point-set embeddings
• Simultaneous visibility representations of plane \(st\)-graphs using L-shapes
• Monotone simultaneous embeddings of paths in d dimensions
• Testing the simultaneous embeddability of two graphs whose intersection is a biconnected graph or a tree
• Simultaneous visibility representations of plane st-graphs using L-shapes
• On a tree and a path with no geometric simultaneous embedding
• Simultaneous embedding of embedded planar graphs
• Quasi-planar Graphs
• Simultaneous embeddings with few bends and crossings
• Geometric simultaneous embeddings of a graph and a matching
• Drawing Simultaneously Embedded Graphs with Few Bends
• On the complexity of simultaneous geometric embedding for edge-disjoint graphs

This page was built for publication: On a tree and a path with no geometric simultaneous embedding

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