The $k$-strong induced arboricity of a graph

Maria Axenovich; Daniel Gonçalves; Jonathan Rollin; Torsten Ueckerdt

doi:10.1016/j.ejc.2017.05.010

Journal Articles European Journal of Combinatorics Year : 2018

The $k$-strong induced arboricity of a graph

(1) , (2) , , (1)

1
2

Maria Axenovich

Function : Author

Karlsruhe Institute of Technology = Karlsruher Institut für Technologie

Daniel Gonçalves

Function : Author
PersonId : 7100
IdHAL : daniel-goncalves
ORCID : 0000-0003-3228-9622
IdRef : 117629413

Algorithmes, Graphes et Combinatoire

CV

Jonathan Rollin

Function : Author

Torsten Ueckerdt

Function : Author

Karlsruhe Institute of Technology = Karlsruher Institut für Technologie

Domains

Discrete Mathematics [cs.DM]

Daniel Goncalves : Connect in order to contact the contributor

https://hal-lirmm.ccsd.cnrs.fr/lirmm-01888032

Submitted on : Thursday, October 4, 2018-4:26:42 PM

Last modification on : Tuesday, June 18, 2024-2:20:04 PM

Dates and versions

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

Identifiers

HAL Id : lirmm-01888032 , version 1
ARXIV : 1607.07174v2
DOI : 10.1016/j.ejc.2017.05.010

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⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

CNRS ALGCO LIRMM TDS-MACS MIPS UNIV-MONTPELLIER

142 View

0 Download

The $k$-strong induced arboricity of a graph

Domains

Dates and versions

Identifiers

Cite

Export

Collections

Altmetric

Share