On the chromatic number of cube-like graphs
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.
scientific article; zbMATH DE number 69890