@article{Axenovich2018TheKI,
title={The k-strong induced arboricity of a graph},
author={Maria Axenovich and Daniel Gonçalves and Jonathan Rollin and Torsten Ueckerdt},
journal={Eur. J. Comb.},
year={2018},
volume={67},
pages={1-20}
}

It is proved thateta (G)⩽468 for every planar graph G and that for each r-chromatic graph Gr with no additive coloring by elements of any abelian group of order r, the minimum number k is denoted byη(G) .Expand

It is shown that deciding properties of graphs definable in first-order logic is fixed-parameter tractable on nowhere dense graph classes, and a "rank-preserving" version of Gaifman's locality theorem is proved.Expand

The point-arboricity ρ(G) of a graphG is defined as the minimum number of subsets in a partition of the point set ofG so that each subset induces an acyclic subgraph. Dually, the tuleity τ(G) is the… Expand