Complexity of recognizing multidistance graphs in \(\mathbb{R}^d\) (Q6576764)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Complexity of recognizing multidistance graphs in \(\mathbb{R}^d\) |
scientific article; zbMATH DE number 7885081
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity of recognizing multidistance graphs in \(\mathbb{R}^d\) |
scientific article; zbMATH DE number 7885081 |
Statements
Complexity of recognizing multidistance graphs in \(\mathbb{R}^d\) (English)
0 references
23 July 2024
0 references
distance graph
0 references
chromatic number
0 references
graph recognition
0 references
0 references
