On the chromatic number of cube-like graphs
type: Item
instance of: scholarly article
title: On the chromatic number of cube-like graphs
zbMATH Open document ID: 0772.05043
DOI: 10.1016/0012-365X(92)90319-B
author: Charles Payan
published in: Discrete Mathematics
publication date: 1992-12-06T00:00:00Z
review text: 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.
reviewed by: Yanpei Liu
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 69890
zbMATH Keywords: coloring
zbMATH Keywords: cube-like graph
zbMATH Keywords: chromatic number
MaRDI profile type: Publication
cites work: Q4094898
cites work: Another characterization of hypercubes
cites work: Matroidal bijections between graphs
cites work: \((0,\lambda)\)-graphs and \(n\)-cubes
cites work: The chromatic number of extended odd graphs is four
full work available at URL: 0012-365x(92)90319-b
OpenAlex ID: W1989093143
description: scientific article; zbMATH DE number 69890