All proper colorings of every colorable BSTS(15)
A Steiner System, denoted S(t,k,v), is a vertex set X containing v vertices, and a collection of subsets of X of size k, called blocks, such that every t vertices from X are in exactly one of the blocks. A Steiner Triple System, or STS, is a special case of a Steiner System where t = 2, k = 3 and v...
Main Authors: | Jeremy Mathews, Brett Tolbert |
---|---|
Format: | Article |
Language: | English |
Published: |
Institute of Mathematics and Computer Science of the Academy of Sciences of Moldova
2010-07-01
|
Series: | Computer Science Journal of Moldova |
Online Access: | http://www.math.md/files/csjm/v18-n1/v18-n1-(pp41-53).pdf |
Similar Items
-
Maximal induced colorable subhypergraphs of all uncolorable BSTS(15)s
by: Jeremy Mathews
Published: (2011-06-01) -
Nowcasting by the BSTS-U-MIDAS Model
by: Duan, Jun
Published: (2015) -
The Orchard Green And Every Color
by: Savich, Zachary
Published: (2011) -
Proper mean colorings of graphs
by: Gary Chartrand, et al.
Published: (2020-01-01) -
Proper and weak-proper trees in edges-colored graphs and multigraphs.
by: Borozan, Valentin
Published: (2011)