Geometric simultaneous embeddings of a graph and a matching
From MaRDI portal
Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)
Recommendations
Cited in
(9)- On a tree and a path with no geometric simultaneous embedding
- On a tree and a path with no geometric simultaneous embedding
- Matched drawings of planar graphs
- Constrained simultaneous and near-simultaneous embeddings
- Matched Drawability of Graph Pairs and of Graph Triples
- Matched Drawings of Planar Graphs
- A geometric theory for hypergraph matching
- Geometric simultaneous embeddings of a graph and a matching
- Matched drawability of graph pairs and of graph triples
This page was built for publication: Geometric simultaneous embeddings of a graph and a matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5900858)