3 citations · 4 across the 19 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
math.CO2026
Diamond-free, claw-free cubic graphs are (1, 1, 2, 3)-packing colorable
Sarah E. Anderson, Kirsti Kuenzel, Juan D. Marcano Cuellar
A -packing coloring of a graph is a partition of into two independent sets, a 2-packing, and a -packing. Recently, the question was posed in [A short pr…
math.CO2026
Characterizing all nonbipartite well-edge-dominated graphs
Sarah E. Anderson, Kirsti Kuenzel
Given a graph , a set of edges is an edge dominating set of if every edge in is either in or adjacent to an edge in . A graph is said to be well-edge-domi…