American Psychological Association 6th edition

Azam, N. A., Shurbevski, A., & Nagamochi, H. (2021). On the enumeration of minimal non-pairwise compatibility graphs. Journal of Combinatorial Optimization, 1-22. https://doi.org/10.1007/s10878-021-00799-x

ISO-690 (author-date, English)

AZAM, Naveed Ahmed, SHURBEVSKI, Aleksandar und NAGAMOCHI, Hiroshi, 2021. On the enumeration of minimal non-pairwise compatibility graphs. Journal of Combinatorial Optimization. 1 September 2021. P. 1-22. DOI 10.1007/s10878-021-00799-x.

Modern Language Association 9th edition

Azam, N. A., A. Shurbevski, und H. Nagamochi. „On the Enumeration of Minimal Non-Pairwise Compatibility Graphs“. Journal of Combinatorial Optimization, September 2021, S. 1-22, https://doi.org/10.1007/s10878-021-00799-x.

Mohr Siebeck - Recht (Deutsch - Österreich)

Azam, Naveed Ahmed/Shurbevski, Aleksandar/Nagamochi, Hiroshi: On the enumeration of minimal non-pairwise compatibility graphs, Journal of Combinatorial Optimization 2021, 1-22.

Emerald - Harvard

Azam, N.A., Shurbevski, A. und Nagamochi, H. (2021), „On the enumeration of minimal non-pairwise compatibility graphs“, Journal of Combinatorial Optimization, S. 1-22.

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