K. Kuenzel

activity

20192026

most citedGraphs with a unique maximum open packing

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

collaborators

Showing 2025Show all

3 papers · 1 filter

math.CO2025

Characterizing all $K_{4}$ -free well-edge-dominated graphs of girth 3

Sarah E. Anderson, Kirsti Kuenzel

Given a graph $G$ , a set $F$ of edges is an edge dominating set if all edges in $G$ are either in $F$ or adjacent to an edge in $F$ . $G$ is said to be well-edge-dominated if every…

math.CO2025

Isolation number: Cartesian and lexicographic products and generalized Sierpiński graphs

Bostjan Bresar, Tanja Dravec, Daniel P. Johnston +3

The isolation number $ι (G)$ of a graph $G$ is the minimum cardinality of a set $A \subset V (G)$ such that the subgraph induced by the vertices that are not in the union of the close…

math.CO2025

Well-hued graphs with first difference two

Geoffrey Boyer, Kirsti Kuenzel, Jeremy Lyle +1

A graph $G$ is said to be well-hued if every maximal $k$ -colorable subgraph of $G$ has the same order $a_{k}$ . Therefore, if $G$ is well-hued, we can associate with $G$ a sequence $\…

Characterizing all K4​-free well-edge-dominated graphs of girth 3

Isolation number: Cartesian and lexicographic products and generalized Sierpiński graphs

Well-hued graphs with first difference two

Characterizing all $K_{4}$ -free well-edge-dominated graphs of girth 3