The $k$-strong induced arboricity of a graph

Maria Axenovich 1 Daniel Gonçalves 2 Jonathan Rollin Torsten Ueckerdt 1
2 ALGCO - Algorithmes, Graphes et Combinatoire
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Document type :
Journal articles
Complete list of metadatas

https://hal-lirmm.ccsd.cnrs.fr/lirmm-01888032
Contributor : Daniel Gonçalves <>
Submitted on : Thursday, October 4, 2018 - 4:26:42 PM
Last modification on : Saturday, October 6, 2018 - 1:15:14 AM

Links full text

Identifiers

Collections

Citation

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

Share

Metrics

Record views

67