On the complexity of list H-packing for sparse graph classes
From MaRDI portal
Publication:6575414
DOI10.1007/978-981-97-0566-5_30MaRDI QIDQ6575414FDOQ6575414
Authors: Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Yota Otachi, Tomohito Shirai, Akira Suzuki, Yuma Tamura, Xiao Zhou 
Publication date: 19 July 2024
Cites Work
- Reducibility among combinatorial problems
- On the Complexity of General Graph Factor Problems
- Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
- A partial k-arboretum of graphs with bounded treewidth
- Approximation algorithms for the test cover problem
- On maximal independent sets of vertices in claw-free graphs
- The Recognition of Series Parallel Digraphs
- On the complexity of partitioning graphs into connected subgraphs
- Title not available (Why is that?)
- Computing independent sets in graphs with large girth
- Packing triangles in bounded degree graphs.
- Generalized planar matching
- Parallel Processing and Applied Mathematics
- The path set packing problem
- Edge-disjoint packings of graphs
- 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)
