Connectivity and W_v-paths in polyhedral maps on surfaces
The paper deals with the \(W_v\)-path conjecture on closed surfaces and others. Starting by recalling the known facts about this conjecture and mentioning the equivalent conjectures in special cases, the paper continues with results giving several bounds for the values of a function \(f(\Sigma)\) defined to give a lower bound for the local connectivity of the embedded graph. Some of the formulae given for this function is related to the Euler characteristic of the underlying surface. Also, there are formulae on the number of components of the intersection of paths with a face of the graph, on the internally disjoint non-revisiting \((x,y)\)-paths, etc.
- W v and W e Paths on Simple 3-Polytopes
- \(W_ v\) paths in the projective plane
- A 2-manifold of genus 8 without the \(W_ v\)-property
- A 3-Sphere Counterexample to the Wv-Path Conjecture
- A counterexample to the Hirsch conjecture
- Graphs on surfaces
- Heawood's theorem and connectivity
- scientific article; zbMATH DE number 3261280 (Why is no real title available?)
- Non-revisiting paths on surfaces with low genus
- Nonrevisiting paths on surfaces
- On essential and inessential polygons in embedded graphs
- On the face touching number
- Paths on Polyhedra. I
- Paths on Polytopes
- The d-Step Conjecture and Its Relatives
- The \(d\)-step conjecture for polyhedra of dimension \(d<6\)
- W\({}_ V\) paths on the torus
- Wv paths on 3-polytopes
This page was built for publication: Connectivity and \(W_v\)-paths in polyhedral maps on surfaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2408192)