Hoang La

From MaRDI portal
Person:2032973



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Quickly excluding an apex-forest
(available as arXiv preprint)
N/APaper
Centered colorings in minor-closed graph classes2026-07-13Paper
Weak coloring numbers of minor-closed graph classes2026-07-03Paper
Quickly excluding an apex-forest
SIAM Journal on Discrete Mathematics
2026-04-01Paper
Partitions of planar (oriented) graphs into a connected acyclic and an independent set
The Electronic Journal of Combinatorics
2026-03-20Paper
The Grid-Minor theorem revisited
Combinatorica
2026-01-20Paper
The -binding function of d-directional segment graphs
Discrete & Computational Geometry
2026-01-06Paper
Centered colorings and weak coloring numbers in minor-closed graph classes
(available as arXiv preprint)
2026-01-01Paper
A Domatic Analogue of χ-Bounded Graph Classes and the Gyárfás-Sumner Conjecture
(available as arXiv preprint)
2026-01-01Paper
Product structure of graphs excluding a topological minor
(available as arXiv preprint)
2026-01-01Paper
Boolean dimension of a Boolean lattice
Order
2025-06-30Paper
2-distance 4-coloring of planar subcubic graphs with girth at least 21
Discrete Mathematics and Theoretical Computer Science. DMTCS
2025-05-07Paper
Graph reconstruction with connectivity queries2025-05-02Paper
Fractional domatic number and minimum degree
(available as arXiv preprint)
2025-01-01Paper
Cube Height, Cube Width and Related Extremal Problems for Posets
(available as arXiv preprint)
2025-01-01Paper
The Grid-Minor theorem revisited2024-11-28Paper
2-distance \((\Delta + 1)\)-coloring of sparse graphs using the potential method
Discrete Mathematics
2024-11-09Paper
Weak coloring numbers of minor-closed graph classes
(available as arXiv preprint)
2024-01-01Paper
Graph Reconstruction with Connectivity Queries
(available as arXiv preprint)
2024-01-01Paper
Centered colorings in minor-closed graph classes
(available as arXiv preprint)
2024-01-01Paper
Partitions of planar (oriented) graphs into a connected acyclic and an independent set
(available as arXiv preprint)
2024-01-01Paper
The \chi-binding function of d-directional segment graphs2023-09-12Paper
Boolean dimension of a Boolean lattice2023-07-31Paper
The grid-minor theorem revisited2023-07-06Paper
2-distance, injective, and exact square list-coloring of planar graphs with maximum degree 4
Discrete Mathematics
2023-05-31Paper
The $\chi$-binding function of $d$-directional segment graphs
(available as arXiv preprint)
2023-01-01Paper
Feedback vertex sets in (directed) graphs of bounded degeneracy or treewidth
The Electronic Journal of Combinatorics
2022-11-08Paper
2-distance list \((\varDelta +3)\)-coloring of sparse graphs
Graphs and Combinatorics
2022-10-13Paper
2-distance list ( +2)-coloring of planar graphs with girth at least 10
Journal of Combinatorial Optimization
2022-08-19Paper
Further extensions of the Grötzsch theorem
Discrete Mathematics
2022-04-11Paper
Computer assisted discharging procedure on planar graphs: application to 2-distance coloring2022-02-08Paper
Computer assisted discharging procedure on planar graphs: application to 2-distance coloring
(available as arXiv preprint)
2022-01-01Paper
$2$-distance list $(\Delta+2)$-coloring of planar graphs with girth at least 10
(available as arXiv preprint)
2021-09-29Paper
2-distance (\Delta+2)-coloring of sparse graphs2021-09-24Paper
A note on deterministic zombies
Discrete Applied Mathematics
2021-06-14Paper
2-distance 4-coloring of planar subcubic graphs with girth at least 212021-06-07Paper
2-distance (\Delta+1)-coloring of sparse graphs using the potential method2021-03-22Paper
\(r\)-hued \((r+1)\)-coloring of planar graphs with girth at least 8 for \(r\geq 9\)
European Journal of Combinatorics
2021-02-08Paper
$2$-distance $(\Delta+2)$-coloring of sparse graphs
(available as arXiv preprint)
2021-01-01Paper


Research outcomes over time


This page was built for person: Hoang La