"On the complexity of list H-packing for sparse graph classes."

Tatsuya Gima et al. (2025)

> Home

Details and statistics

DOI: 10.1016/J.TCS.2025.115425

access: closed

type: Journal Article

metadata version: 2025-08-09

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/tcs/GimaHKOSSTZ25
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/GimaHKOSSTZ25
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. Theor. Comput. Sci. 1052: 115425 (2025)

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.