Ryan Pellico

collaborators

2 papers

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 $\…

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…