Upper chromatic number of Steiner triple and quadruple systems
From MaRDI portal
Publication:1377792
DOI10.1016/S0012-365X(97)80332-9zbMath0901.05012MaRDI QIDQ1377792
Publication date: 26 November 1998
Published in: Discrete Mathematics (Search for Journal in Brave)
Steiner triple systemmixed hypergraphSteiner quadruple systemsupper chromatic numberstrict colouring
Related Items (25)
On the upper chromatic number of \((v_3,b_2)\)-configurations ⋮ Some equitably 3-colourable cycle decompositions ⋮ Colouring 4-cycle systems with equitably coloured blocks ⋮ Triplication for BSTSs and uncolourability ⋮ The monochromatic block number ⋮ Unnamed Item ⋮ Strict colouring for classes of Steiner triple systems ⋮ Maximum number of colors: C-coloring and related problems ⋮ Mixed hypergraphs with bounded degree: Edge-coloring of mixed multigraphs. ⋮ Edge balanced star‐hypergraph designs and vertex colorings of path designs ⋮ Voloshin's colourings of \(P_{3}\)-designs ⋮ Uncolorable mixed hypergraphs ⋮ Nonorientable triangular embeddings of complete graphs with arbitrarily large looseness ⋮ Steiner systems and configurations of points ⋮ On some colouring of 4-cycle systems with specified block colour patterns ⋮ Extended bicolorings of Steiner triple systems of order \(2^{h}-1\) ⋮ A note on the least number of edges of 3-uniform hypergraphs with upper chromatic number 2 ⋮ Coloring mixed hypertrees ⋮ Circular mixed hypergraphs. II: The upper chromatic number ⋮ Mixed hypergraphs and beyond ⋮ Mario Gionfriddo and mixed hypergraph coloring ⋮ Chromatic polynomials of mixed hypercycles ⋮ Bicolouring Steiner systems \(S\)(2,4,\(v\)) ⋮ On Voloshin colorings in 3-hypergraph designs ⋮ Strict colourings of STS(\(3v\))s and uncolourable BSTS(\(3v\))s
Cites Work
This page was built for publication: Upper chromatic number of Steiner triple and quadruple systems
