J. Harrelson

activity

20172022

collaborators

3 papers

math.CO2022

List-Edge-Coloring with Bounded Maximum Degree

Joshua Harrelson

For a graph $G$ , we show that if $ma d (G) < m$ , then $χ_{ℓ}^{'} (G) \leq Δ + 1$ where $m$ depends upon $Δ$ and $χ_{ℓ}^{'} (G)$ is the list-chromatic index of $G$ . When $Δ \leq 20$ the value of…

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.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…