2-distance (Δ+1)-coloring of sparse graphs using the potential method. - Hoang La; Mickaël Montassier (CoRR, 2021)

2-distance 4-coloring of planar subcubic graphs with girth at least 21. - Hoang La; Mickaël Montassier (CoRR, 2021)

2-distance (Δ+2)-coloring of sparse graphs. - Hoang La; Mickaël Montassier (CoRR, 2021)

A note on deterministic zombies. - Valentin Bartier; Laurine Bénéteau; Marthe Bonamy; Hoang La; Jonathan Narboni (Discret. Appl. Math., 2021)

r-hued (r+1)-coloring of planar graphs with girth at least 8 for r≥9. - Hoang La; Mickaël Montassier; Alexandre Pinlou; Petru Valicov (Eur. J. Comb., 2021)

Feedback Vertex Sets in (Directed) Graphs of Bounded Degeneracy or Treewidth. - Kolja Knauer; Hoang La; Petru Valicov (Electron. J. Comb., 2022)

Computer assisted discharging procedure on planar graphs: application to 2-distance coloring. - Hoang La; Petru Valicov (CoRR, 2022)

Further extensions of the Grötzsch Theorem. - Hoang La; Borut Luzar; Kenny Storgel (Discret. Math., 2022)

2-Distance List (Δ+3)$-Coloring of Sparse Graphs. - Hoang La (Graphs Comb., 2022)

2-Distance list (Δ +2)-coloring of planar graphs with girth at least 10. - Hoang La; Mickaël Montassier (J. Comb. Optim., 2022)

The χ-binding function of d-directional segment graphs. - Lech Duraj; Ross J. Kang; Hoang La; Jonathan Narboni; Filip Pokrývka; Clément Rambaud; Amadeus Reinald (CoRR, 2023)

2-distance, injective, and exact square list-coloring of planar graphs with maximum degree 4. - Hoang La; Kenny Storgel (Discret. Math., 2023)

The Grid-Minor Theorem Revisited. - Vida Dujmovic; Robert Hickingbotham; Jedrzej Hodor; Gwenaël Joret; Hoang La; Piotr Micek; Pat Morin; Clément Rambaud; David R. Wood (SODA, 2024)

Graph Reconstruction with Connectivity Queries. - Kacper Kluk; Hoang La; Marta Piecyk (WG, 2024)

Quickly excluding an apex-forest. - Jedrzej Hodor; Hoang La; Piotr Micek; Clément Rambaud (CoRR, 2024)

Centered colorings in minor-closed graph classes. - Jedrzej Hodor; Hoang La; Piotr Micek; Clément Rambaud (CoRR, 2024)

Partitions of planar (oriented) graphs into a connected acyclic and an independent set. - Stijn Cambie; François Dross; Kolja Knauer; Hoang La; Petru Valicov (CoRR, 2024)

Weak coloring numbers of minor-closed graph classes. - Jedrzej Hodor; Hoang La; Piotr Micek; Clément Rambaud (SODA, 2025)

2-Distance (Δ + 1)-coloring of sparse graphs using the potential method. - Hoang La; Mickaël Montassier (Discret. Math., 2025)

Boolean Dimension of a Boolean Lattice. - Marcin Brianski; Jedrzej Hodor; Hoang La; Piotr Micek; Katzper Michno (Order, 2025)