Recognizing a 3-dimensional handle among 4-coloured graphs (Q798988): Difference between revisions

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.