1 citations · 3 across the 14 of their papers we have counts for
15 papers
Product structure of graphs excluding a topological minor
Jędrzej Hodor, Hoang La, Piotr Micek +1
We prove that, for all positive integers and and every graph with , there exists a positive integer such that every graph with $\mat…
A Domatic Analogue of -Bounded Graph Classes and the Gyárfás-Sumner Conjecture
Quentin Chuet, Selma Djelloul, Hoang La +2
Given a graph , a dominating set is a subset such that . The \emph{domatic number} of , denoted , is the maximum size of a partitio…
Fractional domatic number and minimum degree
Quentin Chuet, Hugo Demaret, Hoang La +1
The domatic number of a graph is the maximum number of pairwise disjoint dominating sets of . We are interested in the LP-relaxation of this parameter, which is called the f…
Partitions of planar (oriented) graphs into a connected acyclic and an independent set
Stijn Cambie, François Dross, Kolja Knauer +2
A question at the intersection of Barnette's Hamiltonicity and Neumann-Lara's dicoloring conjecture is: Can every Eulerian oriented planar graph be vertex-partitioned into two acyc…
Graph Reconstruction with Connectivity Queries
Kacper Kluk, Hoang La, Marta Piecyk
We study a problem of reconstruction of connected graphs where the input gives all subsets of size k that induce a connected subgraph. Originally introduced by Bastide et al. (WG 2…
Weak coloring numbers of minor-closed graph classes
Jędrzej Hodor, Hoang La, Piotr Micek +1
We study the growth rate of weak coloring numbers of graphs excluding a fixed graph as a minor. Van den Heuvel et al. (European J. of Combinatorics, 2017) showed that for a fixed g…
Quickly excluding an apex-forest
Jędrzej Hodor, Hoang La, Piotr Micek +1
We give a short proof that for every apex-forest on at least two vertices, graphs excluding as a minor have layered pathwidth at most . This improves upon a resu…
The -binding function of -directional segment graphs
Lech Duraj, Ross J. Kang, Hoang La +4
Given a positive integer , the class -DIR is defined as all those intersection graphs formed from a finite collection of line segments in having at most s…
-distance, injective, and exact square list-coloring of planar graphs with maximum degree 4
Hoang La, Kenny Štorgel
In the past various distance based colorings on planar graphs were introduced. We turn our focus to three of them, namely -distance coloring, injective coloring, and exact squar…
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…
A note on deterministic zombies
Valentin Bartier, Laurine Bénéteau, Marthe Bonamy +2
"Zombies and Survivor" is a variant of the well-studied game of "Cops and Robber" where the zombies (cops) can only move closer to the survivor (robber). We consider the determinis…