The following pages link to Covering arrays on graphs (Q2565691):
Displaying 21 items.
- On optimal binary codes with unbalanced coordinates (Q371241) (← links)
- A construction for strength-3 covering arrays from linear feedback shift register sequences (Q404947) (← links)
- Divisibility of polynomials over finite fields and combinatorial applications (Q411500) (← links)
- Multiplicity-free permutation representations of the symmetric group. (Q659813) (← links)
- Covering arrays from cyclotomy (Q970532) (← links)
- Covering arrays avoiding forbidden edges (Q1040583) (← links)
- Binary covering arrays on tournaments (Q1648654) (← links)
- Algebraic techniques for covering arrays and related structures (Q1739926) (← links)
- A greedy algorithm to construct covering arrays using a graph representation (Q2201668) (← links)
- A survey on the problems and algorithms for covering arrays via set covers (Q2333829) (← links)
- The test suite generation problem: optimal instances and their implications (Q2381816) (← links)
- Covering arrays on product graphs (Q2409504) (← links)
- Mixed covering arrays on 3-uniform hypergraphs (Q2410218) (← links)
- (Q3594048) (← links)
- (Q3625883) (← links)
- Mixed covering arrays on graphs of small treewidth (Q5063252) (← links)
- Disjoint Covers in Replicated Heterogeneous Arrays (Q5202961) (← links)
- Non-uniform covering array with symmetric forbidden edge constraints (Q5206931) (← links)
- Covering Arrays Avoiding Forbidden Edges (Q5505668) (← links)
- Balanced covering arrays: A classification of covering arrays and packing arrays via exact methods (Q6187007) (← links)
- Covering array on the Cartesian product of hypergraphs (Q6581902) (← links)
