6 papers
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…
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…
Characterizing all -free well-edge-dominated graphs of girth 3
Sarah E. Anderson, Kirsti Kuenzel
Given a graph , a set of edges is an edge dominating set if all edges in are either in or adjacent to an edge in . is said to be well-edge-dominated if every…
Isolation number: Cartesian and lexicographic products and generalized SierpiÅski graphs
Bostjan Bresar, Tanja Dravec, Daniel P. Johnston +3
The isolation number of a graph is the minimum cardinality of a set such that the subgraph induced by the vertices that are not in the union of the clos…
Well-hued graphs with first difference two
Geoffrey Boyer, Kirsti Kuenzel, Jeremy Lyle +1
A graph is said to be well-hued if every maximal -colorable subgraph of has the same order . Therefore, if is well-hued, we can associate with a sequence $\…
Well-edge-dominated graphs containing triangles
Jake Berg, Perryn Chang, Claire Kaneshiro +4
A set of edges in a graph is an edge dominating set if every edge in is either in or shares a vertex with an edge in . is said to be well-edge-dominated if a…