American Psychological Association 6th edition

Dereniowski, D., Dybizbański, J., Karpiński, P., Zakrzewski, M., & Żyliński, P. (2025). Low-degree spanning trees of 2-edge-connected graphs in linear time. Journal of Combinatorial Optimization, 50(4). https://doi.org/10.1007/s10878-025-01368-2

ISO-690 (author-date, English)

DERENIOWSKI, Dariusz, DYBIZBAŃSKI, Janusz, KARPIŃSKI, Przemysław, ZAKRZEWSKI, Michał und ŻYLIŃSKI, Paweł, 2025. Low-degree spanning trees of 2-edge-connected graphs in linear time. Journal of Combinatorial Optimization. 1 November 2025. Vol. 50, no. 4, . DOI 10.1007/s10878-025-01368-2.

Modern Language Association 9th edition

Dereniowski, D., J. Dybizbański, P. Karpiński, M. Zakrzewski, und P. Żyliński. „Low-Degree Spanning Trees of 2-Edge-Connected Graphs in Linear Time“. Journal of Combinatorial Optimization, Bd. 50, Nr. 4, November 2025, https://doi.org/10.1007/s10878-025-01368-2.

Mohr Siebeck - Recht (Deutsch - Österreich)

Dereniowski, Dariusz/Dybizbański, Janusz/Karpiński, Przemysław/Zakrzewski, Michał/Żyliński, Paweł: Low-degree spanning trees of 2-edge-connected graphs in linear time, Journal of Combinatorial Optimization 2025,

Emerald - Harvard

Dereniowski, D., Dybizbański, J., Karpiński, P., Zakrzewski, M. und Żyliński, P. (2025), „Low-degree spanning trees of 2-edge-connected graphs in linear time“, Journal of Combinatorial Optimization, Vol. 50 No. 4, verfügbar unter:https://doi.org/10.1007/s10878-025-01368-2.

Achtung: Diese Zitate sind unter Umständen nicht zu 100% korrekt.