"Complexity of Perfect (1, 2)-Dominating Sets in Low-Degree Graphs."

Urszula Bednarz, Jan Kratochvíl, Adrian Michalski (2026)

> Home

Details and statistics

DOI: 10.1007/978-981-95-7127-7_14

access: closed

type: Conference or Workshop Paper

metadata version: 2026-03-24

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/walcom/BednarzKM26
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/walcom/BednarzKM26
Urszula Bednarz, Jan Kratochvíl, Adrian Michalski:
Complexity of Perfect (1, 2)-Dominating Sets in Low-Degree Graphs. WALCOM 2026: 203-214

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.