On the chromatic number of cube-like graphs (Q1195478)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the chromatic number of cube-like graphs |
scientific article |
Statements
On the chromatic number of cube-like graphs (English)
0 references
6 December 1992
0 references
A cube-like graph is a graph whose vertices are all \(2^ n\) subsets of a set \(E\) of cardinality \(n\) and in which two vertices are adjacent if their symmetric difference is a member of a given specified collection of subsets of \(E\). This paper shows a cube-like graph of chromatic number 7 and provides that no cube-like graph has chromatic number 3.
0 references
coloring
0 references
cube-like graph
0 references
chromatic number
0 references
