"Matching Cut in Graphs with Large Minimum Degree."

Sun-Yuan Hsieh et al. (2019)

> Home

Details and statistics

DOI: 10.1007/978-3-030-26176-4_25

access: closed

type: Conference or Workshop Paper

metadata version: 2024-10-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/cocoon/HsiehLLP19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cocoon/HsiehLLP19
Sun-Yuan Hsieh, Hoàng-Oanh Le, Van Bang Le, Sheng-Lung Peng:
Matching Cut in Graphs with Large Minimum Degree. COCOON 2019: 301-312

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.