"Matching Cut in Graphs with Large Minimum Degree."

Chi-Yeh Chen et al. (2021)

> Home

Details and statistics

DOI: 10.1007/S00453-020-00782-8

access: open

type: Journal Article

metadata version: 2024-10-06

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/algorithmica/ChenHLLP21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/ChenHLLP21
Chi-Yeh Chen, Sun-Yuan Hsieh, Hoàng-Oanh Le, Van Bang Le, Sheng-Lung Peng:
Matching Cut in Graphs with Large Minimum Degree. Algorithmica 83(5): 1238-1255 (2021)

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.