n-graphs (Q1115875)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4087677
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | n-graphs |
scientific article; zbMATH DE number 4087677 |
Statements
n-graphs (English)
0 references
1988
0 references
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.
0 references
regular graph
0 references
simplex
0 references
simplicial complex
0 references
fundamental group
0 references
PL n- manifold
0 references
0.7758114337921143
0 references
0.7716353535652161
0 references
0.771610677242279
0 references
