A code for disconnected edge-colored graphs (Q2844267)
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 6202422
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A code for disconnected edge-colored graphs |
scientific article; zbMATH DE number 6202422 |
Statements
28 August 2013
0 references
colored triangulation
0 references
edge-colored graph
0 references
crystallization of a manifold
0 references
A code for disconnected edge-colored graphs (English)
0 references
Edge-colored graphs serve as a combinatorial tool for representing PL manifolds. Been known from 70's this theory is referred to as crystallizations of manifolds. It is useful for encoding manifolds and using computers for investigation of them. The author extends the definition of code of an edge-colored graph to the case of disconnected colored graphs. Also, some properties of the code are demonstrated.
0 references
0.7419545650482178
0 references
