"Finding dominating induced matchings in S2, 2, 3-free graphs in polynomial ..."

Andreas Brandstädt, Raffaele Mosca (2020)

> Home

Details and statistics

DOI: 10.1016/J.DAM.2020.01.028

access: closed

type: Journal Article

metadata version: 2020-07-16

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/dam/BrandstadtM20b
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/BrandstadtM20b
Andreas Brandstädt, Raffaele Mosca:
Finding dominating induced matchings in S2, 2, 3-free graphs in polynomial time. Discret. Appl. Math. 283: 417-434 (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.