The following pages link to Mixed covering arrays on graphs (Q5434623):
Displaying 11 items.
- 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)
- Covering arrays avoiding forbidden edges (Q1040583) (← links)
- Mixed covering arrays of strength three with few factors (Q2276196) (← links)
- Cost-efficient mixed-level covering designs for testing experiments (Q2301219) (← 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)
- Mixed covering arrays on graphs of small treewidth (Q5063252) (← links)
- A hyperedge coloring and application in combinatorial testing (Q5097781) (← links)
- Covering array on the Cartesian product of hypergraphs (Q6581902) (← links)
