#### Filter Results:

#### Publication Year

2010

2012

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

Perfect (v, K, 1) difference families ((v, K, 1)-PDF in short, and (v, k, 1)-PDF when K = {k}) were introduced by Ge et al. for their useful application to the construction of properly centered permutations, which can be used to construct new radar arrays. Some works had been done on the existences of (v, k, 1)-PDFs, while little is known when |K| ≥ 2… (More)

A graph G is said to be chromatic-choosable if ch(G) = χ(G). Ohba has conjectured that every graph G with 2χ(G) + 1 or fewer vertices is chromatic-choosable. It is clear that Ohba's conjecture is true if and only if it is true for complete multipartite graphs. In this paper we show that Ohba's conjecture is true for complete multipartite graphs K 4,3 * t,2… (More)

- ‹
- 1
- ›