#### Filter Results:

#### Publication Year

2011

2013

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

The concept of embedded matching in a weighted graph is introduced , and the maximum cardinality of an embedded matching is computed. On the other hand, consider the following problem induced by a short covering. Given a prime power q, the number c(q) denotes the minimum cardinality of a subset H of F 3 q which satisfies the following property: every… (More)

- ‹
- 1
- ›