1 citations · 2 across the 11 of their papers we have counts for
4 papers · 1 filter
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…