"Hardness of Pre-assignment Problem for Unique Minimum Vertex Cover on ..."

Takashi Horiyama et al. (2025)

> Home

Details and statistics

DOI: 10.1007/978-3-032-04700-7_18

access: closed

type: Conference or Workshop Paper

metadata version: 2025-10-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/fct/HoriyamaSSS25
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/fct/HoriyamaSSS25
Takashi Horiyama, Fumiya Sakamoto, Kazuhisa Seto, Ryu Suzuki:
Hardness of Pre-assignment Problem for Unique Minimum Vertex Cover on Planar Graphs with Maximum Degree 3. FCT 2025: 238-251

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.