Treffer: Connected max cut is polynomial for graphs without the excluded minor K5\e
Title:
Connected max cut is polynomial for graphs without the excluded minor K5\e
Authors:
Chaourar, BrahimAff1, IDs10878020006376_cor1
Source:
Journal of Combinatorial Optimization. :1-7
Database:
Springer Nature Journals