n-graphs

From MaRDI portal
N-graphs





An n-graph is a regular graph of degree n, together with an edge- colouring in n colours such that incident edges receive different colours. Any PL n-manifold can be, in a natural way, encoded by means of an \((n+1)\)-graph, giving thus rise to a graph-theoretic approach to the investigation of PL-manifolds. In the paper, the basic ideas and major results of this combinatorial method are surveyed.




Cited in
(25)








This page was built for publication: n-graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1115875)