SEFE without mapping via large induced outerplane graphs in plane graphs
From MaRDI portal
Publication:2811194
DOI10.1002/JGT.21884zbMATH Open1339.05062OpenAlexW2597508670MaRDI QIDQ2811194FDOQ2811194
W. Evans, Patrizio Angelini, Joachim Gudmundsson, Fabrizio Frati
Publication date: 10 June 2016
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.21884
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Depth-First Search and Linear Graph Algorithms
- On acyclic colorings of planar graphs
- On simultaneous planar graph embeddings
- Maximum induced forests of planar graphs
- On embedding an outer-planar graph in a point set
- Maximum induced linear forests in outerplanar graphs
- On the linear vertex-arboricity of a planar graph
- Embedding Vertices at Points: Few Bends Suffice for Planar Graphs
- On Universal Point Sets for Planar Graphs
Cited In (3)
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)