Florian Lehner, Babak Miraftab. Sparse cycle bases for graphs with bounded genus. // European Journal of Combinatorics. – 2026. – DOI: 10.1016/j.ejc.2026.104371. – URL: https://doi.org/10.1016/j.ejc.2026.104371
Florian Lehner & Babak Miraftab (2026). Sparse cycle bases for graphs with bounded genus. European Journal of Combinatorics. https://doi.org/10.1016/j.ejc.2026.104371
Florian Lehner and Babak Miraftab. “Sparse cycle bases for graphs with bounded genus.” European Journal of Combinatorics, 2026. doi:10.1016/j.ejc.2026.104371.
@article{Lehner2026,
title = {Sparse cycle bases for graphs with bounded genus},
author = {Lehner, Florian and Miraftab, Babak},
journal = {European Journal of Combinatorics},
year = {2026},
doi = {10.1016/j.ejc.2026.104371},
url = {https://doi.org/10.1016/j.ejc.2026.104371}
}