Kirsti Wash

activity

20122016

(1, 1, 2, 2)

-colorings, and characterizing the Petersen graph

3 citations · 5 across the 5 of their papers we have counts for

collaborators

5 papers

math.CO2016★ 1 cited

Packing chromatic number under local changes in a graph

Boštjan Brešar, Sandi Klavžar, Douglas F. Rall +1

The packing chromatic number $χ_{ρ} (G)$ of a graph $G$ is the smallest integer $k$ such that there exists a $k$ -vertex coloring of $G$ in which any two vertices receiving color $i$ a…

math.CO2016★ 3 cited

Packing chromatic number, $(1, 1, 2, 2)$ -colorings, and characterizing the Petersen graph

Boštjan Brešar, Sandi Klavžar, Douglas F. Rall +1

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}, \dots, Π_{k}$ , where $Π_{i}$ , $i\in […

math.CO2015

Matchings and Path Covers with applications to Domination in Graphs

Michael A. Henning, Kirsti Wash

Let $G$ be a graph with no isolated vertex. A matching in $G$ is a set of edges that are pairwise not adjacent in $G$ , while the matching number, $α^{'} (G)$ , of $G$ is the maximum siz…

math.CO2014

Trees with Large Neighborhood Total Domination Number

Michael A. Henning, Kirsti Wash

In this paper, we continue the study of neighborhood total domination in graphs first studied by Arumugam and Sivagnanam [Opuscula Math. 31 (2011), 519--531]. A neighborhood total…

math.CO2012★ 1 cited

Identifying codes of the direct product of two cliques

Douglas F. Rall, Kirsti Wash

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. It…