The vertex-adjacency dual of a triangulated irregular network has a Hamiltonian cycle. (Q703228)
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 2125885
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The vertex-adjacency dual of a triangulated irregular network has a Hamiltonian cycle. |
scientific article; zbMATH DE number 2125885 |
Statements
The vertex-adjacency dual of a triangulated irregular network has a Hamiltonian cycle. (English)
0 references
11 January 2005
0 references
Hamiltonian cycle
0 references
Triangulated irregular network
0 references
Triangle mesh
0 references
Triangulation
0 references
0.7575944066047668
0 references
0.7558363080024719
0 references
0.7524256706237793
0 references
0.7404709458351135
0 references
0.7394148707389832
0 references
