The k-strong induced arboricity of a graph

@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}
}

Figures from this paper

Induced and Weak Induced Arboricities

References

SHOWING 1-10 OF 46 REFERENCES
Additive Coloring of Planar Graphs
TLDR
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) .
Colouring graphs with bounded generalized colouring number
Tree-depth, subgraph coloring and homomorphism bounds
Deciding first-order properties of nowhere dense graphs
TLDR
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.
The point-arboricity of a graph
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
Locally identifying coloring in bounded expansion classes of graphs
Excluding any graph as a minor allows a low tree-width 2-coloring
An inequality involving the vertex arboricity and edge arboricity of a graph
  • S. Burr
  • Mathematics
    J. Graph Theory
  • 1986
TLDR
The inequality a(G) ⩽ a1 (G) is proved, and this is sharp, and two related inequalities, involving another parameter, are also proved.
...
...