On list coloring Steiner triple systems
From MaRDI portal
Publication:3578155
DOI10.1002/jcd.20215zbMath1222.05060MaRDI QIDQ3578155
No author found.
Publication date: 13 July 2010
Published in: Journal of Combinatorial Designs (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jcd.20215
Related Items
On the Choice Number of Packings, List colorings of multipartite hypergraphs, Online containers for hypergraphs, with applications to linear equations, Dense uniform hypergraphs have high list chromatic number, Hypergraph containers, List Colourings of Regular Hypergraphs, Hypergraph list coloring and Euclidean Ramsey theory
Cites Work
- Unnamed Item
- Unnamed Item
- The list chromatic index of a bipartite multigraph
- Hypergraph extension of the Alon-Tarsi list coloring theorem
- Some Remarks on the Triple Systems of Steiner.
- Coloring Steiner Triple Systems
- Graph colorings with local constraints -- a survey
- Coloring BIBDs with block size 4
- The Dinitz problem solved for rectangles
- ON THE CONSTRUCTION OF BALANCED INCOMPLETE BLOCK DESIGNS
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations