A hyperedge coloring and application in combinatorial testing
For a hypergraph H, a uniform k-coloring of hyperedges always has the same (to within 1) number of hyperedges of each color, whereas an equitable k-coloring of hyperedges has the property that at every vertex all the colors incident the same number of times (to within 1). For every [Formula: see tex...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2022-05-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Subjects: | |
| Online Access: | https://www.tandfonline.com/doi/10.1080/09728600.2022.2081523 |