Amena Assem, Marcel Koloschin, Max Pitz. The Nash-Williams orientation theorem for graphs with countably many ends. // European Journal of Combinatorics. – 2025. – DOI: 10.1016/j.ejc.2024.104043. – URL: https://doi.org/10.1016/j.ejc.2024.104043
Amena Assem, Marcel Koloschin, & Max Pitz (2025). The Nash-Williams orientation theorem for graphs with countably many ends. European Journal of Combinatorics. https://doi.org/10.1016/j.ejc.2024.104043
Amena Assem, et al. “The Nash-Williams orientation theorem for graphs with countably many ends.” European Journal of Combinatorics, 2025. doi:10.1016/j.ejc.2024.104043.
@article{Assem2025,
title = {The Nash-Williams orientation theorem for graphs with countably many ends},
author = {Assem, Amena and Koloschin, Marcel and Pitz, Max},
journal = {European Journal of Combinatorics},
year = {2025},
doi = {10.1016/j.ejc.2024.104043},
url = {https://doi.org/10.1016/j.ejc.2024.104043}
}