Bicoloring Steiner triple systems
From MaRDI portal
Publication:1292237
zbMATH Open0924.05007MaRDI QIDQ1292237FDOQ1292237
Charles J. Colbourn, Alexander Rosa, J. 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
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
Cited In (24)
- Large monochromatic components in 3‐edge‐colored Steiner triple systems
- Circular mixed hypergraphs. II: The upper chromatic number
- Edge balanced star‐hypergraph designs and vertex colorings of path designs
- Title not available (Why is that?)
- Voloshin's colourings of \(P_{3}\)-designs
- Large Cross-Free Sets in Steiner Triple Systems
- Mario Gionfriddo and mixed hypergraph coloring
- Bicolouring Steiner systems \(S\)(2,4,\(v\))
- Strict colouring for classes of Steiner triple systems
- Strict colourings of STS(\(3v\))s and uncolourable BSTS(\(3v\))s
- Some equitably 3-colourable cycle decompositions
- Colouring 4-cycle systems with equitably coloured blocks
- CM ELLIPTIC CURVES AND BICOLORINGS OF STEINER TRIPLE SYSTEMS
- Non-monochromatic non-rainbow colourings of \(\sigma\)-hypergraphs
- Mixed hypergraphs with bounded degree: Edge-coloring of mixed multigraphs.
- Grooming for two-period optical networks
- Cardinal: a finite sets constraint solver
- Mixed hypercacti
- Coloring mixed hypertrees
- Bicolour graphs of Steiner triple systems
- Set-Codes with Small Intersections and Small Discrepancies
- \((2, 2)\)-colourings and clique-free \(\sigma\)-hypergraphs
- Extended bicolorings of Steiner triple systems of order \(2^{h}-1\)
- On some colouring of 4-cycle systems with specified block colour patterns
This page was built for publication: Bicoloring Steiner triple systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1292237)
