Efficient spectral bounds on the chromatic number of Hamming, Johnson, and Kneser graph powers

Documenti analoghi

• Spectral approaches for $d$-improper chromatic number
  di: Guo, Krystal, et al.
  Pubblicazione: (2024)
• Burning numbers via eigenpolytopes -- Hamming graphs, Johnson graphs, and halved cubes
  di: Tanaka, Hajime, et al.
  Pubblicazione: (2025)
• On the number of minimal forts of a graph
  di: Becker, Paul, et al.
  Pubblicazione: (2024)
• Minimum number of distinct eigenvalues of distance-regular and signed Johnson graphs
  di: Fallat, Shaun, et al.
  Pubblicazione: (2024)
• The Kneser chromatic function distinguishes trees
  di: Nishimura, Yusaku
  Pubblicazione: (2024)