1 citations · 2 across the 5 of their papers we have counts for
5 papers
On some posets and lattices with the same height
Hoan La
For a finite poset , its height is the number of cover relations in its longest chain. When is a lattice , we label its ele…
Boolean dimension of a Boolean lattice
Marcin Briański, Jędrzej Hodor, Hoang La +2
For every integer with , we prove that the Boolean dimension of a poset consisting of all the subsets of equipped with the inclusion relation is stric…
The grid-minor theorem revisited
Vida Dujmović, Robert Hickingbotham, Jędrzej Hodor +6
We prove that for every planar graph of treedepth , there exists a positive integer such that for every -minor-free graph , there exists a graph of treewidth a…
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…
-distance -coloring of sparse graphs
Hoang La, Mickael Montassier
A -distance -coloring of a graph is a proper -coloring of the vertices where vertices at distance at most 2 cannot share the same color. We prove the existence of a -di…