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.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
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.