Sorry, we do not have enough data to show an influence graph for this author.

#### Filter Results:

- Full text PDF available (1)

#### Publication Type

#### Journals and Conferences

#### Key Phrases

Learn More

- Shantanu Chhabra
- ArXiv
- 2013

We define an n-gon to be any convex polygon with n vertices. Let V represent the set of vertices of the polygon. A “proper” k-coloring refers to a function, f : V → {1, 2, 3, . . . k}, such that for any two vertices u and v, if f(u) = f(v), u is not adjacent to v. The purpose of this paper is to develop a recursive algorithm to compute the number of proper… (More)

- ‹
- 1
- ›