La Hoang

activity

20212025

most cited

2

-distance

(Δ + 1)

-coloring of sparse graphs using the potential method

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

collaborators

4 papers

math.CO2025

Fractional domatic number and minimum degree

Quentin Chuet, Hugo Demaret, Hoang La +1

The domatic number of a graph $G$ is the maximum number of pairwise disjoint dominating sets of $G$ . We are interested in the LP-relaxation of this parameter, which is called the f…

math.CO2024

Partitions of planar (oriented) graphs into a connected acyclic and an independent set

Stijn Cambie, François Dross, Kolja Knauer +2

A question at the intersection of Barnette's Hamiltonicity and Neumann-Lara's dicoloring conjecture is: Can every Eulerian oriented planar graph be vertex-partitioned into two acyc…

math.CO2021

$2$ -distance list $(Δ + 2)$ -coloring of planar graphs with girth at least 10

Hoang La, Mickael Montassier

Given a graph $G$ and a list assignment $L (v)$ for each vertex of $v$ of $G$ . A proper $L$ -list-coloring of $G$ is a function that maps every vertex to a color in $L (v)$ such that…

math.CO2021★ 1 cited

$2$ -distance $(Δ + 1)$ -coloring of sparse graphs using the potential method

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…

Fractional domatic number and minimum degree

Partitions of planar (oriented) graphs into a connected acyclic and an independent set

2-distance list (Δ+2)-coloring of planar graphs with girth at least 10

2-distance (Δ+1)-coloring of sparse graphs using the potential method

$2$ -distance list $(Δ + 2)$ -coloring of planar graphs with girth at least 10

$2$ -distance $(Δ + 1)$ -coloring of sparse graphs using the potential method