On the upper and lower chromatic numbers of BSQSs(16)
type: Item
instance of: scholarly article
title: On the upper and lower chromatic numbers of BSQSs(16)
zbMATH Open document ID: 0974.05034
author: Giovanni Lo Faro
author: Lorenzo Milazzo
author: Antoinette Tripodi
published in: The Electronic Journal of Combinatorics
publication date: 2001-02-08T00:00:00Z
full work available at URL: https://eudml.org/doc/121403
full work available at URL: v8i1r6.html
review text: A \(\text{BSQS}(16)\) is a Steiner quadruple system on 16 vertices, considered as a mixed hypergraph with each block belonging to both classes. Accordingly it is asked for vertex colourings of \(\text{BSQSs}(16)\) such that in each block not all the vertices are equally coloured and not all are differently coloured. It is shown that each \(\text{BSQS}(16)\) is colourable that way and that in any case the maximum number of colours is three, while the minimum number may be two or three, both cases occurring.
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 51E10
zbMATH DE Number: 1557044
zbMATH Keywords: chromatic number
zbMATH Keywords: Steiner quadruple system
zbMATH Keywords: mixed hypergraph
zbMATH Keywords: vertex colourings
reviewed by: Gerd Wegner
MaRDI profile type: Publication
Recommended article: Q4867928
Recommended article: Lower and upper chromatic numbers for BSTSs\((2^h-1)\)
Recommended article: Upper bounds on the \(b\)-chromatic number and results for restricted graph classes
Recommended article: Q4414507
Recommended article: Q5279059
Recommended article: The \(b\)-chromatic number and related topics -- a survey
Recommended article: Q4526632
Recommended article: Theb-chromatic number of certain graphs and digraphs
Recommended article: Q4871176
Recommended article: On the chromatic number of \(q\)-Kneser graphs
description: scientific article; zbMATH DE number 1557044