"On the Complexity of List H-Packing for Sparse Graph Classes."

Tatsuya Gima et al. (2024)

> Home

Details and statistics

DOI: 10.1007/978-981-97-0566-5_30

access: closed

type: Conference or Workshop Paper

metadata version: 2024-03-16

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/walcom/GimaHKOSST024
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/walcom/GimaHKOSST024
Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Yota Otachi, Tomohito Shirai, Akira Suzuki, Yuma Tamura, Xiao Zhou:
On the Complexity of List H-Packing for Sparse Graph Classes. WALCOM 2024: 421-435

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.