K_{1,k}-free graphs have CFCN* choice number O(k ln Δ); deciding if CFCN*/CFON* choice number equals 1 or 2 is NP-hard.
Minimum-weight triangulation is np-hard.Jour- nal of the ACM (JACM), 55(2):1–29
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
-
Computational and Combinatorial Results on Conflict-free Choosability
K_{1,k}-free graphs have CFCN* choice number O(k ln Δ); deciding if CFCN*/CFON* choice number equals 1 or 2 is NP-hard.