Recognizing a 3-dimensional handle among 4-coloured graphs
Let H be a subgraph of \(\Gamma\) with vertices v and w joined by two edges e,f which are colored by two different colors \(\alpha\),\(\beta \in\Delta \). Let \(\{\alpha',\beta '\}=\Delta -\{\alpha,\beta\}\) and call \(U_{\{\alpha',\beta '\}}(v)\), \(U_{\{\alpha',\beta '\}}(w)\) the connected components of \(\Gamma_{\{\alpha',\beta '\}}\) containing v and w respectively. H is called a combinatorial handle if and only if \(U_{\{\alpha',\beta '\}}(v)=U_{\{\alpha',\beta '\}}(w)\) and \(\Gamma\) has order greater than two. The main result of the paper is that if (\(\Gamma\),\(\gamma)\) is a crystallization of M admitting the handle H then \(M\simeq M'\#S^ 1\otimes S^ 2\) where M' is some closed 3-manifold and \(S^ 1\otimes S^ 2\) is a 2-sphere bundle over \(S^ 1\). In addition, the paper contains a number of questions concerning crystallizations.
- A simple proof of Gagliardi's handle recognition theorem
- Graph-encoded 3-manifolds
- Handles in graphs and sphere bundles over S^ 1
- A graph-theoretical representation of PL-manifolds -- a survey on crystallizations
- Simple contracted complexes are nonshellable
- n-graphs
- Generalized handles in graphs and connected sums of manifolds
- Combinatorial handles and manifolds with boundary
- scientific article; zbMATH DE number 4180343 (Why is no real title available?)
- scientific article; zbMATH DE number 3872305 (Why is no real title available?)
- scientific article; zbMATH DE number 4203287 (Why is no real title available?)
- scientific article; zbMATH DE number 774992 (Why is no real title available?)
- 2-symmetric crystallizations and 2-fold branched coverings of \(S^ 3\)
- Topological aspects of edge fusions in 4-graphs
This page was built for publication: Recognizing a 3-dimensional handle among 4-coloured graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q798988)
