Chromatic Sum admits full complexity classifications on HH-minor-free, HH-topological-minor-free, and H-free graphs via known frameworks plus new NP-completeness reductions from planar subcubic graphs.
Routing with minimum wire length in the dogleg-free manhattan model is NP-complete.SIAM Journal on Computing, 29:274–287, 1999
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
-
Determining the Complexity of Chromatic Sum in Classes Defined by a Set of Forbidden Graphs
Chromatic Sum admits full complexity classifications on HH-minor-free, HH-topological-minor-free, and H-free graphs via known frameworks plus new NP-completeness reductions from planar subcubic graphs.