Παραπομπή σε μορφή APA (7η εκδ.)

Buahong, S., Suppakitpaisarn, V., & Sripratak, P. (2025). Finding a b-matching that embeds the maximum number of edge pairs in a given set. Journal of Combinatorial Optimization, 49(5), . https://doi.org/10.1007/s10878-025-01305-3

Παραπομπή σε μορφή Chicago (17η εκδ.)

Buahong, Siraphob, Vorapong Suppakitpaisarn, και Piyashat Sripratak. "Finding a B-matching That Embeds the Maximum Number of Edge Pairs in a Given Set." Journal of Combinatorial Optimization 49, no. 5 (2025). https://doi.org/10.1007/s10878-025-01305-3.

Παραπομπή σε μορφή MLA (9th εκδ.)

Buahong, Siraphob, et al. "Finding a B-matching That Embeds the Maximum Number of Edge Pairs in a Given Set." Journal of Combinatorial Optimization, vol. 49, no. 5, 2025, https://doi.org/10.1007/s10878-025-01305-3.