#### Filter Results:

- Full text PDF available (11)

#### Publication Year

2009

2018

- This year (1)
- Last 5 years (16)
- Last 10 years (18)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Wayne Goddard, Kirsti Wash
- 2013

An identifying code in a graph G is a set D of vertices such that the closed neighborhood of each vertex of the graph has a nonempty, distinct intersection with D. The minimum cardinality of an… (More)

- Wayne Goddard, Kirsti Wash, Honghai Xu
- Discussiones Mathematicae Graph Theory
- 2015

Given a coloring of the vertices, we say subgraph H is monochromatic if every vertex of H is assigned the same color, and rainbow if no pair of vertices of H are assigned the same color. Given a… (More)

Given a coloring of the vertices, we say subgraph H is monochromatic if every vertex of H is assigned the same color, and rainbow if no pair of vertices of H are assigned the same color. Given a… (More)

- Douglas F. Rall, Kirsti Wash
- Eur. J. Comb.
- 2014

An identifying code in a graph is a dominating set that also has the property that the closed neighborhood of each vertex in the graph has a distinct intersection with the set. The minimum… (More)

- Bostjan Bresar, Sandi Klavzar, Douglas F. Rall, Kirsti Wash
- Discrete Mathematics
- 2017

The packing chromatic number χρ(G) of a graphG is the smallest integer k such that there exists a k-vertex coloring of G in which any two vertices receiving color i are at distance at least i+1. It… (More)

- Douglas F. Rall, Kirsti Wash
- Graphs and Combinatorics
- 2017

An identifying code in a graph is a dominating set that also has the property that the closed neighborhood of each vertex in the graph has a distinct intersection with the set. The minimum… (More)

- Weizhen Gu, Kirsti Wash
- Journal of Interconnection Networks
- 2009

For any permutation α on the vertex set of a graph G, the permutation graph Pα(G) is obtained by taking two copies of G, denoted G and G ′, and joining u ∈ V (G) and v ∈ V (G′) if and only if α(u) =… (More)

- Sarah E. Anderson, S. Nagpal, Kirsti Wash
- Discrete Mathematics
- 2018

- Jim Brown, ALFEEN HASMANI, LINDSEY HILTNER, ANGELA KRAFT, Daniel Scofield, Kirsti Wash
- 2012

In previous works, Jones-Roberts and Pauli-Roblot have studied finite extensions of the p-adic numbers Qp. This paper focuses on results for local fields of characteristic p. In particular we are… (More)

The packing chromatic number χρ(G) of a graph G is the smallest integer k such that the vertex set of G can be partitioned into sets Π1, . . . ,Πk, where Πi, i ∈ [k], is an i-packing. The following… (More)