On Short Noncontractible Cycles in Embedded Graphs
From MaRDI portal
Recommendations
Cited in
(18)- Spanning trees in locally planar triangulations
- A simple construction of high representativity triangulations
- Long cycles in graphs on a fixed surface
- Filling triangulated surfaces
- Flips on homologous orientations of surface graphs with prescribed forbidden facial cycles
- Face-width of embedded graphs
- scientific article; zbMATH DE number 426373 (Why is no real title available?)
- scientific article; zbMATH DE number 3877217 (Why is no real title available?)
- On a Lower Bound for Short Noncontractible Cycles in Embedded Graphs
- scientific article; zbMATH DE number 4068901 (Why is no real title available?)
- Algorithms for the edge-width of an embedded graph
- scientific article; zbMATH DE number 475596 (Why is no real title available?)
- scientific article; zbMATH DE number 475598 (Why is no real title available?)
- Algorithms – ESA 2005
- Better distance labeling for unweighted planar graphs
- Short Topological Decompositions of Non-Orientable Surfaces
- Short topological decompositions of non-orientable surfaces
- Embeddings of graphs with no short noncontractible cycles
This page was built for publication: On Short Noncontractible Cycles in Embedded Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3813826)