Conformability is NP-complete even for connected regular graphs of odd order with α(G)=3 and Δ(G)≥|V(G)|/2 via reduction from perfect triangle packing.
Pandu Rangan, Maw-Shang Chang, Gerard J
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
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.
citing papers explorer
-
Conformability is NP-complete, even on connected regular graphs
Conformability is NP-complete even for connected regular graphs of odd order with α(G)=3 and Δ(G)≥|V(G)|/2 via reduction from perfect triangle packing.
-
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.