Proves λ_P3(G) ≥ ⌊n/5⌋ (asymptotically tight) and λ_{P2∪P1}(T) ≥ ⌊n/3⌋-2 (poly-time) in triangulations, with degree-based bounds and a face-path characterization for triangle factors.
An improved kernel for planar vertex-disjoint triangle packing.Theoret
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DM 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
3-packings in Triangulations: Algorithms, bounds, and Complexity
Proves λ_P3(G) ≥ ⌊n/5⌋ (asymptotically tight) and λ_{P2∪P1}(T) ≥ ⌊n/3⌋-2 (poly-time) in triangulations, with degree-based bounds and a face-path characterization for triangle factors.