On the complexity of list \(\mathcal{H}\)-packing for sparse graph classes
From MaRDI portal
Publication:6575414
DOI10.1007/978-981-97-0566-5_30MaRDI QIDQ6575414
Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Xiao Zhou, Tomohito Shirai, Yota Otachi, Akira Suzuki, Yuma Tamura
Publication date: 19 July 2024
Cites Work
- Title not available (Why is that?)
- On the complexity of partitioning graphs into connected subgraphs
- On maximal independent sets of vertices in claw-free graphs
- Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
- Computing independent sets in graphs with large girth
- A partial k-arboretum of graphs with bounded treewidth
- Edge-disjoint packings of graphs
- Approximation algorithms for the test cover problem
- The path set packing problem
- Packing triangles in bounded degree graphs.
- On the Complexity of General Graph Factor Problems
- Generalized planar matching
- The Recognition of Series Parallel Digraphs
- Reducibility among Combinatorial Problems
- Parallel Processing and Applied Mathematics
- Parameterized complexity of path set packing
This page was built for publication: On the complexity of list \(\mathcal{H}\)-packing for sparse graph classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6575414)
