Bicoloring Steiner triple systems
From MaRDI portal
Publication:1292237
Recommendations
Cited in
(27)- Mixed hypergraphs with bounded degree: Edge-coloring of mixed multigraphs.
- scientific article; zbMATH DE number 1867225 (Why is no real title available?)
- Set-codes with small intersections and small discrepancies
- Some equitably 3-colourable cycle decompositions
- Coloring mixed hypertrees
- Voloshin's colourings of \(P_{3}\)-designs
- Grooming for two-period optical networks
- Mixed hypercacti
- Extending bicolorings for Steiner triple systems
- Non-monochromatic non-rainbow colourings of \(\sigma\)-hypergraphs
- Feasible sets of small bicolorable STSs
- Large monochromatic components in 3‐edge‐colored Steiner triple systems
- Edge balanced star‐hypergraph designs and vertex colorings of path designs
- \((2, 2)\)-colourings and clique-free \(\sigma\)-hypergraphs
- Mario Gionfriddo and mixed hypergraph coloring
- Extended bicolorings of Steiner triple systems of order \(2^{h}-1\)
- Cardinal: a finite sets constraint solver
- Strict colourings of STS(\(3v\))s and uncolourable BSTS(\(3v\))s
- On some colouring of 4-cycle systems with specified block colour patterns
- CM ELLIPTIC CURVES AND BICOLORINGS OF STEINER TRIPLE SYSTEMS
- Bicolouring Steiner systems \(S\)(2,4,\(v\))
- Colouring 4-cycle systems with equitably coloured blocks
- System of unbiased representatives for a collection of bicolorings
- Circular mixed hypergraphs. II: The upper chromatic number
- Large cross-free sets in Steiner triple systems
- Strict colouring for classes of Steiner triple systems
- Bicolour graphs of Steiner triple systems
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)