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

2 papers · 1 filter

math.CO2018

Non-monochromatic Triangles in a 2-Edge-Coloured Graph

Matt DeVos, Jessica McDonald, Amanda Montejano

Let $G = (V, E)$ be a simple graph and let ${R, B}$ be a partition of $E$ . We prove that whenever $∣ E ∣ + min {∣ R ∣, ∣ B ∣} > (2 ∣ V ∣)$ , there exists a subgraph of $G$ iso…

math.CO2018

Packing and covering directed triangles

Jessica McDonald, Gregory J. Puleo, Craig Tennenhouse

We prove that if a directed multigraph $D$ has at most $t$ pairwise arc-disjoint directed triangles, then there exists a set of less than $2 t$ arcs in $D$ which meets all directed…