Name
Abstract | ||
|---|---|---|
The class epsilon(k) of hypergraphs with a k-exclusive sum labelling is hereditary, but non-trivial to characterise even for k = 1. Our main result is a complete description of the minimal forbidden induced subhypergraphs of epsilon(1) that are 3-uniform with maximum vertex degree 2. We also show that every hypertree has a 1-exclusive sum labelling and every combinatorial design does not. |
Year | DOI | Venue |
|---|---|---|
2022 | 10.1007/s00373-021-02432-4 | GRAPHS AND COMBINATORICS |
Keywords | DocType | Volume |
Exclusive sum labellings, Hypergraphs, Hereditary classes | Journal | 38 |
Issue | ISSN | Citations |
2 | 0911-0119 | 0 |
PageRank | References | Authors |
0.34 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Christopher Purcell | 1 | 0 | 0.68 |
| Joe Ryan | 2 | 0 | 0.34 |
| Zdenek Ryjácek | 3 | 0 | 0.34 |
| Mária Skyvová | 4 | 0 | 0.34 |