"On graphs that contain exactly k copies of a subgraph, and a ..."

Dániel Gerbner et al. (2023)

> Home

Details and statistics

DOI: 10.1016/J.DAM.2023.08.012

access: open

type: Journal Article

metadata version: 2024-06-08

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dam/GerbnerKLNPPVW23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/GerbnerKLNPPVW23
Dániel Gerbner, Balázs Keszegh, Dániel Lenger, Dániel T. Nagy, Dömötör Pálvölgyi, Balázs Patkós, Máté Vizer, Gábor Wiener:
On graphs that contain exactly k copies of a subgraph, and a related problem in search theory. Discret. Appl. Math. 341: 196-203 (2023)

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.