SEFE without mapping via large induced outerplane graphs in plane graphs
From MaRDI portal
Publication:2811194
Recommendations
- SEFE with no mapping via large induced outerplane graphs in plane graphs
- Characterizations of restricted pairs of planar graphs allowing simultaneous embedding with fixed edges
- Characterizations of Restricted Pairs of Planar Graphs Allowing Simultaneous Embedding with Fixed Edges
- Characterizing simultaneous embedding with fixed edges
- Simultaneous embedding of embedded planar graphs
Cites work
- scientific article; zbMATH DE number 3556125 (Why is no real title available?)
- scientific article; zbMATH DE number 3270498 (Why is no real title available?)
- Depth-First Search and Linear Graph Algorithms
- Embedding Vertices at Points: Few Bends Suffice for Planar Graphs
- Maximum induced forests of planar graphs
- Maximum induced linear forests in outerplanar graphs
- On acyclic colorings of planar graphs
- On embedding an outer-planar graph in a point set
- On simultaneous planar graph embeddings
- On the linear vertex-arboricity of a planar graph
- On universal point sets for planar graphs
Cited in
(4)
This page was built for publication: SEFE without mapping via large induced outerplane graphs in plane graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2811194)