Jørgen Bang-Jensen, Stéphane Bessy, Daniel Gonçalves 0001, Lucas Picasarri-Arrieta. Complexity of some arc-partition problems for digraphs. Theoretical Computer Science, 928:167-182, 2022. [doi]
@article{Bang-JensenBGP22,
title = {Complexity of some arc-partition problems for digraphs},
author = {Jørgen Bang-Jensen and Stéphane Bessy and Daniel Gonçalves 0001 and Lucas Picasarri-Arrieta},
year = {2022},
doi = {10.1016/j.tcs.2022.06.023},
url = {https://doi.org/10.1016/j.tcs.2022.06.023},
researchr = {https://researchr.org/publication/Bang-JensenBGP22},
cites = {0},
citedby = {0},
journal = {Theoretical Computer Science},
volume = {928},
pages = {167-182},
}