Optimization of inertia-type bounds for k-independence and distance-k chromatic numbers of graphs is polynomial-time solvable for fixed k.
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
-
Optimization and complexity of inertia-type bounds on the independence and chromatic numbers of graph powers
Optimization of inertia-type bounds for k-independence and distance-k chromatic numbers of graphs is polynomial-time solvable for fixed k.