About me ^[1][2]

I am a researcher in graph theory. I graduated from the Theoretical Computer Science Department of the École Normale Supérieure de Lyon (ENS Lyon), France in 2019. I finished my Ph.D. thesis on 2-distance coloring of sparse graphs at the Laboratoire d'Informatique, de Robotique, et de Microélectronique de Montpellier (LIRMM), France under the supervision of Mickael Montassier, Alexandre Pinlou, and Petru Valicov in 2022. I was a post-doc with Piotr Micek in the Theoretical Computer Science group at the Uniwersytet Jagielloński in Kraków, Poland between 2022 and 2023. I became a Maître de Conférences at the Université Paris-Saclay in France in 2023. Research-wise, I work in the Graphs, Algorithms, and Combinatorics (GALaC) group at the LISN. Teaching-wise, I work at the Computer Science Department of the Institut Universitaire de Technologie d'Orsay (IUT Orsay).

My current projects¶

Structural graph theory

• Centered colorings and weak coloring numbers of minor-closed graph classes
• Elimination depth

Graph coloring

• Fractional domatic number and minimum degree
• Domatic number boundedness in dense graph classes
• LOCAL non-repetitive colorings
• Automation of the discharging method
• Odd coloring

Graph reconstruction

• Graph reconstruction via induced subgraphs queries
• Reconstruction of causal graphs

Poset dimension

• Fitting posets into a hypercube
• Dimension of planar posets with bounded number of minimum elements

Publications¶

1. Paul Bastide, Jędrzej Hodor, Hoang La, and William T. Trotter.
   Fitting posets into a hypercube.
   Coming Soon.

2. Jędrzej Hodor, Hoang La, Piotr Micek, and Clément Rambaud.
   Centered colorings and weak coloring numbers of minor-closed graph classes.
   Coming Soon.

3. Florian Galliot, Hoang La, Raphaëlle Maistre, Matthieu Petiteau, and Dimitri Watel.
   Graph reconstruction from queries on triples.
   Coming Soon.

4. Quentin Chuet, Hugo Demaret, Hoang La, and François Pirot.
   Fractional domatic number and minimum degree.
   Coming Soon.

5. Jędrzej Hodor, Hoang La, Piotr Micek, and Clément Rambaud.
   Centered colorings of minor-closed graph classes.
   arXiv:2411.02122

6. Stijn Cambie, François Dross, Kolja Knauer, Hoang La, and Petru Valicov.
   Partitions of planar (oriented) graphs into a connected acyclic and an independent set.
   arXiv:2412.11774

7. Jędrzej Hodor, Hoang La, Piotr Micek, and Clément Rambaud.
   Weak coloring numbers of minor-closed graph classes.
   SODA, 2025.

8. Jędrzej Hodor, Hoang La, Piotr Micek, and Clément Rambaud.
   Quickly excluding an apex forest.
   Accepted at SIAM Journal on Discrete Mathematics, 2025.

9. Lech Duraj, Ross J. Kang, Hoang La, Jonathan Narboni, Filip Pokrývka, Clément Rambaud, and Amadeus Reinald.
   The χ-binding function of d-directional segment graphs.
   arXiv:2309.06072

10. Vida Dujmović, Robert Hickingbotham, Jędrzej Hodor, Gwenaël Joret, Hoang La, Piotr Micek, Pat Morin, Clément Rambaud, and David R. Wood.
    The grid-minor theorem revisited.
    SODA, 2024.

11. Kacper Kluk, Hoang La, and Marta Piecyk.
    Graph Reconstruction with Connectivity Queries.
    WG, 2024.

12. Marcin Briański, Jędrzej Hodor, Hoang La, Piotr Micek, and Katzper Michno.
    Boolean Dimension of a Boolean Lattice.
    Order, 2024.

13. Hoang La and Kenny Storgel.
    2-distance, injective, and exact square coloring of planar graphs with maximum degree 4.
    Discrete Mathematics, 346(8):113405, 2023.

14. Hoang La and Petru Valicov.
    Computer assisted discharging procedure on planar graphs: application to 2-distance coloring.
    arXiv:2202.03885

15. Kolja Knauer, Hoang La, and Petru Valicov.
    Feedback vertex sets in (directed) graphs of bounded degeneracy or treewidth.
    Electronic Journal of Combinatorics, 29(4):P4.16, 2022.

16. Hoang La, Borut Luzar, and Kenny Storgel.
    Further extensions of Grötzsch Theorem.
    Discrete Mathematics, 345(6):112849, 2022.

17. Hoang La and Mickael Montassier.
    2-distance list (Δ+2)-coloring of planar graphs with girth at least 10.
    Journal of Combinatorial Optimization. 44:1356–1375, 2022.

18. Hoang La and Mickael Montassier.
    2-distance (Δ + 2)-coloring of sparse graphs.
    arXiv:2109.11927

19. Hoang La and Mickael Montassier.
    2-distance 4-coloring of planar subcubic graphs with girth at least 21.
    Discrete Mathematics & Theoretical Computer Science, 26:3, 2025.

20. Hoang La.
    2-distance list (Δ + 3)-coloring of sparse graphs.
    Graphs and Combinatorics, 38:167, 2022.

21. Hoang La and Mickael Montassier.
    2-distance (Δ + 1)-coloring of sparse graphs using the potential method.
    Discrete Mathematics, 348(1):114292, 2025

22. Valentin Bartier, Laurine Bénéteau, Marthe Bonamy, Hoang La, and Jonathan Narboni.
    A note on deterministic zombies.
    Discrete Applied Mathematics, 301:65-68, 2021.

23. Hoang La, Mickael Montassier, Alexandre Pinlou, and Petru Valicov.
    r-hued (r + 1)-coloring of planar graphs with girth at least 8 for r ≥ 9.
    European Journal of Combinatorics, 91:103219, 2021.

Talks¶

Conferences

• (10PCC) The 10th Polish Combinatorial Conference, Będlewo, Poland, September 2024.
  Fractional domatic number and minimum degree.

• (9PCC) The 9th Polish Combinatorial Conference, Będlewo, Poland, September 2022.
  Feedback vertex sets in (directed) graphs of bounded degeneracy or treewidth.

• (ICGT22) The 11th International Colloquium on Graph Theory and combinatorics, Montpellier, France, July 2022.
  Feedback vertex sets in (directed) graphs of bounded degeneracy or treewidth.

• (JGA21) Journées Graphes et Algorithmes 2021, Online, November 2021.
  2-distance (Δ + 1)-coloring of sparse graphs using the potential method.

• (EUROCOMB21) European Conference on Combinatorics, Graph Theory and Applications 2021, Barcelona, Spain, September 2021.
  2-distance (Δ + 1)-coloring of sparse graphs using the potential method.

• (JGA20) Journées Graphes et Algorithmes 2020, Online, November 2020.
  A computer-assisted discharging method: application to 2-distance coloring.

• (BGW19) Bordeaux Graph Workshop 2019, Bordeaux, France, October 2019.
  r-hued (r + 1)-coloring of planar graphs with girth at least 8 for r ≥ 9.

• (JGA19) Journées Graphes et Algorithmes 2019, Brussels, Belgium, November 2019.
  r-hued (r + 1)-coloring of planar graphs with girth at least 8 for r ≥ 9.

Seminars

• TCS, Jagiellonian University, Kraków, Poland, April 23, 2025.
  LOCAL non-repetitive colorings of graphs.
  Video.

• TCS, Jagiellonian University, Kraków, Poland, April 17, 2024.
  Graph reconstruction with connectivity queries.
  Video.

• School of Mathematics, Shandong University, Jinan, China, March 5, 2024.
  The χ-binding function of d-directional segment graphs.

• Combinatorics, Graph Theory, and Ordered Sets, Faculty of Mathematics and Information Science, Warsaw, Poland, January 21, 2024.
  The χ-binding function of d-directional segment graphs.

• GALaC, LISN, Gif-sur-Yvette, France, November 10, 2023.
  The χ-binding function of d-directional segment graphs.

• GALaC, LISN, Gif-sur-Yvette, France, April 28, 2023.
  Boolean dimension of boolean lattices.

• TCS, Jagiellonian University, Kraków, Poland, November 16, 2022.
  On Barnette’s Conjecture for directed graphs.
  Video.

• AlGCo, LIRMM, Montpellier, France, March 10, 2022.
  The potential method in graphs with a bounded maximum average degree.

• GT Graphes et Optimisation, LABRI, Bordeaux, France, October 29, 2021.
  Further extensions of Grötzsch Theorem.

• AlGCo, LIRMM, Montpellier, France, December 17, 2020.
  A computer-assisted discharging method: application to 2-distance coloring.

Teaching¶

IUT Orsay

• Spring 2025. Advanced development: Unity.
  Lessons and lab sessions for third-year Bachelor students.

• Spring 2025. Coding Project.
  Third-year Bachelor students.

• Spring 2025. Coding Project.
  First-year Bachelor students.

• Spring 2025. Code Quality.
  Lessons and lab sessions for first-year Bachelor students.

• January 2025. Code Game Jam.
  30 hours Game Jam event for Bachelor students.

• Spring 2024. Advanced development: Unity.
  Game project for third-year Bachelor students.

• Spring 2024. Code Quality.
  Lessons and lab sessions for first-year Bachelor students.

• Fall 2023 – Spring 2024. Coding Project.
  Third-year Bachelor students.

• Fall 2023. Databases: ER Diagram/SQL.
  Exercises, and lab sessions for first-year Bachelor students.

Uniwersytet Jagielloński

• Spring 2023. Graph coloring and decomposition.
  Lessons and exercices for Master students.

IUT Montpellier-Sète

• Spring 2022. Databases: ER Diagram/SQL.
  Lessons, exercises, and lab sessions for first-year Bachelor students.
• Spring 2022. Web Development: Client (Javascript).
  Lab sessions for second-year Bachelor students.
• Fall 2020 - Spring 2021. Web Development: Server (PHP/MySQL/MVC).
  Lab sessions for second-year Bachelor students.
• Winter 2019. Java Coding Project.
  Second-year Bachelor students.
• Fall 2019. Web Development: HTML/CSS.
  Lab sessions for first-year Bachelor students.
• Fall 2019. Algorithms and JAVA programming.
  Exercises sessions for first-year Bachelor students.

Students¶

Interns

• Elena Vucenic (co-supervised with Clément Chenevière), Université Paris-Saclay, L1 internship at LISN, 2025.
• Bianca Oancea (co-supervised with Clément Chenevière), Université Paris-Saclay, L1 internship at LISN, 2025.
• Hossein Zaredehabadi (co-supervised with François Pirot), École Normale Supérieure de Paris-Saclay, M1 internship at LISN, 2025.
• Thomas Delépine (co-supervised with François Pirot), Université Paris-Saclay, M2 internship at LISN, 2024.
• Hugo Demaret (co-supervised with François Pirot), Polytechnique Paris, M1 internship at LISN, 2024.
• Raphaëlle Maistre--Matus, Université Paris-Saclay, L3 internship at LISN, 2024.