Every 3-colorable graph has a faithful representation in the odd-distance graph (Q2344791)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Every 3-colorable graph has a faithful representation in the odd-distance graph |
scientific article |
Statements
Every 3-colorable graph has a faithful representation in the odd-distance graph (English)
0 references
18 May 2015
0 references
integral-distance graphs
0 references
odd-distance graph
0 references
faithful representation
0 references
3-colorable graphs
0 references
