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 2024Show all

3 papers · 1 filter

math.CO2024

Well-edge-dominated graphs containing triangles

Jake Berg, Perryn Chang, Claire Kaneshiro +4

A set of edges $F$ in a graph $G$ is an edge dominating set if every edge in $G$ is either in $F$ or shares a vertex with an edge in $F$ . $G$ is said to be well-edge-dominated if a…

math.CO2024

Claw-free cubic graphs are $(1, 1, 2, 2)$ -colorable

Boštjan Brešar, Kirsti Kuenzel, Douglas F. Rall

A $(1, 1, 2, 2)$ -coloring of a graph is a partition of its vertex set into four sets two of which are independent and the other two are $2$ -packings. In this paper, we prove that ever…

math.CO2024

Isolation game on graphs

Boštjan Brešar, Tanja Dravec, Daniel P. Johnston +2

Given a graph $G$ and a family of graphs $F$ , an $F$ -isolating set, as introduced by Caro and Hansberg, is any set $S \subset V (G)$ such that $G - N [S]$ contains no member…

Well-edge-dominated graphs containing triangles

Claw-free cubic graphs are (1,1,2,2)-colorable

Isolation game on graphs

Claw-free cubic graphs are $(1, 1, 2, 2)$ -colorable