3 citations · 8 across the 25 of their papers we have counts for
7 papers · 1 filter
Centered colorings in minor-closed graph classes
Jędrzej Hodor, Hoang La, Piotr Micek +1
A vertex coloring of a graph is -centered if for every connected subgraph of , either uses more than colors on , or there is a color that appears exact…
Blow-ups and extensions of trees in tournaments
Pierre Aboulker, Frédéric Havet, William Lochet +3
A class of acyclic digraphs is linearly unavoidable if there exists a constant such that every digraph is contained in all tournaments of order…
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…
Diameter of the inversion graph
Frédéric Havet, Florian Hörsch, Clément Rambaud
In an oriented graph , the inversion of a subset of vertices consists in reversing the orientation of all arcs with both endvertices in . The inversion graph of a l…
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…
Partitioning a Planar Graph into two Triangle-Forests
Kolja Knauer, Clément Rambaud, Torsten Ueckerdt
We show that the vertices of every planar graph can be partitioned into two sets, each inducing a so-called triangle-forest, i.e., a graph with no cycles of length more than three.…
Subdivisions in dicritical digraphs with large order or digirth
Lucas Picasarri-Arrieta, Clément Rambaud
Aboulker et al. proved that a digraph with large enough dichromatic number contains any fixed digraph as a subdivision. The dichromatic number of a digraph is the smallest order of…