Bicoloring Steiner triple systems
From MaRDI portal
Publication:1292237
zbMath0924.05007MaRDI QIDQ1292237
Charles J. Colbourn, Alexander Rosa, Jeffrey H. Dinitz
Publication date: 20 June 1999
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/119979
Related Items (19)
Some equitably 3-colourable cycle decompositions ⋮ Colouring 4-cycle systems with equitably coloured blocks ⋮ Mixed hypercacti ⋮ Cardinal: a finite sets constraint solver ⋮ Non-monochromatic non-rainbow colourings of \(\sigma\)-hypergraphs ⋮ Large Cross-Free Sets in Steiner Triple Systems ⋮ Mixed hypergraphs with bounded degree: Edge-coloring of mixed multigraphs. ⋮ Edge balanced star‐hypergraph designs and vertex colorings of path designs ⋮ Set-Codes with Small Intersections and Small Discrepancies ⋮ Large monochromatic components in 3‐edge‐colored Steiner triple systems ⋮ Voloshin's colourings of \(P_{3}\)-designs ⋮ Grooming for two-period optical networks ⋮ On some colouring of 4-cycle systems with specified block colour patterns ⋮ Extended bicolorings of Steiner triple systems of order \(2^{h}-1\) ⋮ Coloring mixed hypertrees ⋮ Circular mixed hypergraphs. II: The upper chromatic number ⋮ Mario Gionfriddo and mixed hypergraph coloring ⋮ Strict colourings of STS(\(3v\))s and uncolourable BSTS(\(3v\))s ⋮ \((2, 2)\)-colourings and clique-free \(\sigma\)-hypergraphs
This page was built for publication: Bicoloring Steiner triple systems
