A discharging method: improved kernels for edge triangle packing and covering

DOI10.1007/978-3-031-49193-1_13MaRDI QIDQ6591629

Zimo Sheng, Mingyu Xiao

Publication date: 22 August 2024

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Maximum bounded \(H\)-matching is Max SNP-complete
• A \((3+\epsilon)k\)-vertex kernel for edge-disjoint triangle packing
• Parameterized algorithms and kernels for almost induced matching
• Towards optimal kernel for edge-disjoint triangle packing
• On generating triangle-free graphs
• Kernelization and Parameterized Algorithms for 3-Path Vertex Cover
• On the Size of Systems of Sets Every t of which Have an SDR, with an Application to the Worst-Case Ratio of Heuristics for Packing Problems
• The NP-Completeness of Some Edge-Partition Problems
• Approximation algorithms for NP-complete problems on planar graphs
• Parameterized and Exact Computation
• Parameterized and Exact Computation
• Parameterized Algorithms

This page was built for publication: A discharging method: improved kernels for edge triangle packing and covering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6591629)