Research problems (Q5967016)
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 4127253
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Research problems |
scientific article; zbMATH DE number 4127253 |
Statements
Research problems (English)
0 references
1989
0 references
The problem is to prove that the path \(P_ n\) is not Gray codable for \(n\geq 7\).
0 references
Gray codable
0 references
