J. McDonald

activity

20102023

most citedUpper bounds for inverse domination in graphs

4 citations · 9 across the 20 of their papers we have counts for

collaborators

Showing 2019Show all

4 papers · 1 filter

math.CO2019

On clique immersions in line graphs

Michael Guyer, Jessica McDonald

We prove that if $L (G)$ immerses $K_{t}$ then $L (m G)$ immerses $K_{m t}$ , where $m G$ is the graph obtained from $G$ by replacing each edge in $G$ with a parallel edge of multiplicity…

math.CO2019

List-Edge-Coloring Triangulations with Maximum Degree at most 5

Joshua Harrelson, Jessica McDonald

We prove that triangulations with maximum degree at most 5 satisfy the List-Edge-Coloring Conjecture.

math.CO2019

Clique immersion in graph products

Karen L. Collins, Megan E. Heenehan, Jessica McDonald

Let $G, H$ be graphs and $G * H$ represent a particular graph product of $G$ and $H$ . We define $im (G)$ to be the largest $t$ such that $G$ has a $K_{t}$ -immersion and ask: given $im(G)…

math.CO2019★ 4 cited

Upper bounds for inverse domination in graphs

Elliot Krop, Jessica McDonald, Gregory J. Puleo

In any graph $G$ , the domination number $γ (G)$ is at most the independence number $α (G)$ . The Inverse Domination Conjecture says that, in any isolate-free $G$ , there exists pair of…