1 citations · 2 across the 11 of their papers we have counts for
5 papers · 1 filter
Feedback vertex sets in (directed) graphs of bounded degeneracy or treewidth
Kolja Knauer, Hoang La, Petru Valicov
We study the minimum size of a feedback vertex set in directed and undirected -vertex graphs of given degeneracy or treewidth. In the undirected setting the bound $\frac{k-1…
Further Extensions of the Grötzsch Theorem
Hoang La, Borut Lužar, Kenny Štorgel
The Grötzsch Theorem states that every triangle-free planar graph admits a proper -coloring. Among many of its generalizations, the one of Grünbaum and Aksenov, giving -color…
-distance list -coloring of planar graphs with girth at least 10
Hoang La, Mickael Montassier
Given a graph and a list assignment for each vertex of of . A proper -list-coloring of is a function that maps every vertex to a color in such that…
2-distance 4-coloring of planar subcubic graphs with girth at least 21
Hoang La, Mickael Montassier
A -distance -coloring of a graph is a proper vertex -coloring where vertices at distance at most 2 cannot share the same color. We prove the existence of a -distance $4…
-distance -coloring of sparse graphs using the potential method
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…