American Psychological Association 6th edition

Chaourar, B. (2020). Connected max cut is polynomial for graphs without the excluded minor K5\e. Journal of Combinatorial Optimization, 1-7. https://doi.org/10.1007/s10878-020-00637-6

ISO-690 (author-date, English)

CHAOURAR, Brahim, 2020. Connected max cut is polynomial for graphs without the excluded minor K5\e. Journal of Combinatorial Optimization. 10 August 2020. P. 1-7. DOI 10.1007/s10878-020-00637-6.

Modern Language Association 9th edition

Chaourar, B. “Connected Max Cut Is Polynomial for Graphs Without the Excluded Minor K5\e”. Journal of Combinatorial Optimization, Aug. 2020, pp. 1-7, https://doi.org/10.1007/s10878-020-00637-6.

Mohr Siebeck - Recht (Deutsch - Österreich)

Chaourar, Brahim: Connected max cut is polynomial for graphs without the excluded minor K5\e, Journal of Combinatorial Optimization 2020, 1-7.

Emerald - Harvard

Chaourar, B. (2020), “Connected max cut is polynomial for graphs without the excluded minor K5\e”, Journal of Combinatorial Optimization, pp. 1-7.

Warning: These citations may not always be 100% accurate.