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

DOI10.1007/978-981-97-0566-5_30MaRDI QIDQ6575414zbMATH OpenFDO

Authors Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Yota Otachi, Tomohito Shirai, Akira Suzuki, Yuma Tamura, Xiao Zhou

Publication date 19 July 2024

zbMATH Keywords

parameterized complexitypacking problemsparse graph

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• scientific article; zbMATH DE number 3726401 (Why is no real title available?)
• A partial k-arboretum of graphs with bounded treewidth
• Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
• Approximation algorithms for the test cover problem
• Computing independent sets in graphs with large girth
• Edge-disjoint packings of graphs
• Generalized planar matching
• On maximal independent sets of vertices in claw-free graphs
• On the Complexity of General Graph Factor Problems
• On the complexity of partitioning graphs into connected subgraphs
• Packing triangles in bounded degree graphs.
• Parallel Processing and Applied Mathematics
• Parameterized complexity of path set packing
• Reducibility among combinatorial problems
• The Recognition of Series Parallel Digraphs
• The path set packing problem

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)