Pages that link to "Item:Q1269896"
From MaRDI portal
The following pages link to Covering graphs: The covering problem solved (Q1269896):
Displaying 12 items.
- Generalising Fisher's inequality to coverings and packings (Q681600) (← links)
- Constructions and bounds for separating hash families (Q724890) (← links)
- Efficient covering designs of the complete graph (Q1378499) (← links)
- Packings and coverings of \(\lambda K_{v}\) by \(k\)-circuits with one chord. (Q1428531) (← links)
- Packing and decomposition of graphs with trees (Q1569062) (← links)
- Orthogonal decomposition and packing of complete graphs (Q1806215) (← links)
- Group divisible covering designs with block size 4: A type of covering array with row limit (Q2842263) (← links)
- (Q3193427) (← links)
- Constructions of optimal packing and covering of the complete multigraph with applications (Q3400280) (← links)
- (Q3688169) (← links)
- (Q4691855) (← links)
- Packing cliques in 3‐uniform hypergraphs (Q6187456) (← links)