Spectral and SDP methods yield sharp bounds on injective chromatic number, open packing number, and related parameters, with new exact values for hypercubes.
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
-
Spectral bounds for distance coloring and packing parameters of graphs via semidefinite programming
Spectral and SDP methods yield sharp bounds on injective chromatic number, open packing number, and related parameters, with new exact values for hypercubes.