Bernshteyn, A. (2022). A fast distributed algorithm for (Δ + 1)-edge-coloring. Journal of combinatorial theory. Series B, 152, 319-352. https://doi.org/10.1016/j.jctb.2021.10.004
Citace podle Chicago (17th ed.)Bernshteyn, Anton. "A Fast Distributed Algorithm for (Δ + 1)-edge-coloring." Journal of Combinatorial Theory. Series B 152 (2022): 319-352. https://doi.org/10.1016/j.jctb.2021.10.004.
Citace podle MLA (9th ed.)Bernshteyn, Anton. "A Fast Distributed Algorithm for (Δ + 1)-edge-coloring." Journal of Combinatorial Theory. Series B, vol. 152, 2022, pp. 319-352, https://doi.org/10.1016/j.jctb.2021.10.004.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..