Hoang La

most citedComputer assisted discharging procedure on planar graphs: application to 2-distance coloring

1 citations · 1 across the 2 of their papers we have counts for

collaborators

2 papers

math.CO2022★ 1 cited

Computer assisted discharging procedure on planar graphs: application to 2-distance coloring

Hoang La, Petru Valicov

Using computational techniques we provide a framework for proving results on subclasses of planar graphs via discharging method. The aim of this paper is to apply these techniques…

math.CO2021

$2$ -distance $(Δ + 2)$ -coloring of sparse graphs

Hoang La, Mickael Montassier

A $2$ -distance $k$ -coloring of a graph is a proper $k$ -coloring of the vertices where vertices at distance at most 2 cannot share the same color. We prove the existence of a $2$ -di…

Computer assisted discharging procedure on planar graphs: application to 2-distance coloring

2-distance (Δ+2)-coloring of sparse graphs

$2$ -distance $(Δ + 2)$ -coloring of sparse graphs