"Connected max cut is polynomial for graphs without the excluded minor ..."

Brahim Chaourar (2020)

> Home

Details and statistics

DOI: 10.1007/S10878-020-00637-6

access: closed

type: Journal Article

metadata version: 2020-11-07

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jco/Chaourar20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jco/Chaourar20
Brahim Chaourar:
Connected max cut is polynomial for graphs without the excluded minor $K_5\backslash e$. J. Comb. Optim. 40(4): 869-875 (2020)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.