Upper chromatic number of Steiner triple and quadruple systems
From MaRDI portal
(Redirected from Publication:1377792)
Recommendations
- Strict colorings of Steiner triple and quadruple systems: A survey
- scientific article; zbMATH DE number 851453
- scientific article; zbMATH DE number 5202627
- Lower and upper chromatic numbers for BSTSs\((2^h-1)\)
- A primal-dual property of the upper chromatic number of mixed hypergraphs
- scientific article; zbMATH DE number 5492378
- Chromatic spectrum is broken
- The chromatic spectrum of mixed hypergraphs
- Strict colouring for classes of Steiner triple systems
- Strict colourings for classes of 4-cycle systems
Cites work
- scientific article; zbMATH DE number 3874089 (Why is no real title available?)
- scientific article; zbMATH DE number 786134 (Why is no real title available?)
- scientific article; zbMATH DE number 3397560 (Why is no real title available?)
- 2-colourings in S(t, t+1, v)
- On Quadruple Systems
- Steiner quadruple systems - a survey
Cited in
(32)- On some colouring of 4-cycle systems with specified block colour patterns
- Circular mixed hypergraphs. II: The upper chromatic number
- Upper chromatic number of Steiner triple systems.
- Chromatic polynomials of mixed hypercycles
- Edge balanced star‐hypergraph designs and vertex colorings of path designs
- On the upper chromatic number of (v₃,b₂)-configurations
- Triplication for BSTSs and uncolourability
- Voloshin's colourings of \(P_{3}\)-designs
- Strict colourings for classes of 4-cycle systems
- A primal-dual property of the upper chromatic number of mixed hypergraphs
- Bicolouring Steiner systems \(S\)(2,4,\(v\))
- Strict colouring for classes of Steiner triple systems
- Mario Gionfriddo and mixed hypergraph coloring
- Strict colourings of STS(\(3v\))s and uncolourable BSTS(\(3v\))s
- scientific article; zbMATH DE number 1290170 (Why is no real title available?)
- Maximum number of colors: C-coloring and related problems
- Logarithmic upper bound for the upper chromatic number of \(S(t,t+1,v)\) systems
- Strict colorings of Steiner triple and quadruple systems: A survey
- Some equitably 3-colourable cycle decompositions
- Steiner systems and configurations of points
- Colouring 4-cycle systems with equitably coloured blocks
- 5‐chromatic steiner triple systems
- Mixed hypergraphs with bounded degree: Edge-coloring of mixed multigraphs.
- Mixed hypergraphs and beyond
- Uncolorable mixed hypergraphs
- On Voloshin colorings in 3-hypergraph designs
- Lower and upper chromatic numbers for BSTSs\((2^h-1)\)
- The monochromatic block number
- A note on the least number of edges of 3-uniform hypergraphs with upper chromatic number 2
- Coloring mixed hypertrees
- Nonorientable triangular embeddings of complete graphs with arbitrarily large looseness
- Extended bicolorings of Steiner triple systems of order \(2^{h}-1\)
This page was built for publication: Upper chromatic number of Steiner triple and quadruple systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1377792)
