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

3 papers · 1 filter

math.CO2017

$t$ -cores for $(Δ + t)$ -edge-colouring

Jessica McDonald, Gregory J. Puleo

We extend the edge-coloring notion of core (subgraph induced by the vertices of maximum degree) to $t$ -core (subgraph induced by the vertices $v$ with $d (v) + μ (v) > Δ + t$ ), and find a…

math.CO2017

List-edge-colouring planar graphs with precoloured edges

Joshua Harrelson, Jessica McDonald, Gregory J. Puleo

Let $G$ be a simple planar graph of maximum degree $Δ$ , let $t$ be a positive integer, and let $L$ be an edge list assignment on $G$ with $∣ L (e) ∣ \geq Δ + t$ for all $e \in E (G)$ . We…

math.CO2017★ 1 cited

3-Flows with Large Support

Matt DeVos, Jessica McDonald, Irene Pivotto +2

We prove that every 3-edge-connected graph $G$ has a 3-flow $ϕ$ with the property that $∣ s u pp (ϕ) ∣ \geq \frac{5}{6} ∣ E (G) ∣$ . The graph $K_{4}$ demonstrates that this $\frac{5}…

t-cores for (Δ+t)-edge-colouring

List-edge-colouring planar graphs with precoloured edges

3-Flows with Large Support

$t$ -cores for $(Δ + t)$ -edge-colouring