Probabilistic embeddings of bounded genus graphs into planar graphs
From MaRDI portal
Publication:3602875
Recommendations
Cited in
(14)- \(k\)-outerplanar graphs, planar duality, and low stretch spanning trees
- A tight upper bound on the probabilistic embedding of series-parallel graphs
- Planarizing an unknown surface
- A note on multiflows and treewidth
- Randomly removing \(g\) handles at once
- Shortest path embeddings of graphs on surfaces
- Cops, robbers, and threatening skeletons: padded decomposition for minor-free graphs
- Pathwidth, trees, and random embeddings
- Computing the shortest essential cycle
- Quasimetric embeddings and their applications
- Shortest path embeddings of graphs on surfaces
- Local certification of graphs with bounded genus
- The random graph embeds in the curve graph of any infinite genus surface
- Randomly removing \(g\) handles at once
This page was built for publication: Probabilistic embeddings of bounded genus graphs into planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3602875)