On the upper and lower chromatic numbers of BSQSs(16)
From MaRDI portal
Publication:1593852
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.
Recommendations
- scientific article; zbMATH DE number 851453
- Lower and upper chromatic numbers for BSTSs\((2^h-1)\)
- Upper bounds on the b-chromatic number and results for restricted graph classes
- scientific article; zbMATH DE number 1953103
- On the b-chromatic number of some graphs
- The b-chromatic number and related topics -- a survey
- scientific article; zbMATH DE number 1556742
- The \(b\)-chromatic number of certain graphs and digraphs
- scientific article; zbMATH DE number 861441
- On the chromatic number of \(q\)-Kneser graphs
Cited in
(9)- Chromatic polynomials of mixed hypercycles
- scientific article; zbMATH DE number 1491633 (Why is no real title available?)
- Mario Gionfriddo and mixed hypergraph coloring
- Colouring Steiner quadruple systems
- Lower and upper chromatic numbers for BSTSs\((2^h-1)\)
- Edge balanced star‐hypergraph designs and vertex colorings of path designs
- Feasible sets for vertex colorings of P₄-designs
- On Voloshin colorings in 3-hypergraph designs
- The Steiner quadruple systems of order 16
This page was built for publication: On the upper and lower chromatic numbers of BSQSs(16)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1593852)