The $k$-strong induced arboricity of a graph - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Journal Articles European Journal of Combinatorics Year : 2018

Dates and versions

lirmm-01888032 , version 1 (04-10-2018)

Identifiers

Cite

Maria Axenovich, Daniel Gonçalves, Jonathan Rollin, Torsten Ueckerdt. The $k$-strong induced arboricity of a graph. European Journal of Combinatorics, 2018, 67, pp.1-20. ⟨10.1016/j.ejc.2017.05.010⟩. ⟨lirmm-01888032⟩
134 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More