Covering arrays on graphs

DOI10.1016/j.jctb.2005.03.005zbMath1074.05021OpenAlexW2024021998MaRDI QIDQ2565691

Karen Meagher, Brett Stevens

Publication date: 28 September 2005

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2005.03.005

zbMATH Keywords

CoreOrthogonal arrayGraph homomorphismGeneralized colouringsSoftware and network testing

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Coloring of graphs and hypergraphs (05C15)

Related Items

Non-uniform covering array with symmetric forbidden edge constraints ⋮ The test suite generation problem: optimal instances and their implications ⋮ Mixed covering arrays on graphs of small treewidth ⋮ Binary covering arrays on tournaments ⋮ On optimal binary codes with unbalanced coordinates ⋮ Covering arrays on product graphs ⋮ Mixed covering arrays on 3-uniform hypergraphs ⋮ A construction for strength-3 covering arrays from linear feedback shift register sequences ⋮ Divisibility of polynomials over finite fields and combinatorial applications ⋮ Balanced covering arrays: A classification of covering arrays and packing arrays via exact methods ⋮ Multiplicity-free permutation representations of the symmetric group. ⋮ Algebraic techniques for covering arrays and related structures ⋮ Covering arrays avoiding forbidden edges ⋮ A survey on the problems and algorithms for covering arrays via set covers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An edge-coloration theorem for bipartite graphs with applications
• Lower bounds for transversal covers
• Covering arrays of strength three
• The multichromatic numbers of some Kneser graphs
• Concerning difference matrices
• Two applications (for search theory and truth functions) of Sperner type theorems
• Families of \(k\)-independent sets
• A decomposition theorem for partially ordered sets
• On the state of strength-three covering arrays
• Vector sets for exhaustive testing of logic circuits
• Covering arrays with mixed alphabet sizes
• Covering arrays and intersecting codes
• Compressing inconsistent data
• Frozen development in graph coloring