"Matching Cuts in Graphs of High Girth and H-Free Graphs."

Carl Feghali et al. (2025)

> Home

Details and statistics

DOI: 10.1007/S00453-025-01318-8

access: closed

type: Journal Article

metadata version: 2025-08-29

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/FeghaliLPR25
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/FeghaliLPR25
Carl Feghali, Felicia Lucke, Daniël Paulusma, Bernard Ries:
Matching Cuts in Graphs of High Girth and H-Free Graphs. Algorithmica 87(8): 1199-1221 (2025)

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.