Bipartite graphs are $(\frac{4}{5}-\varepsilon) \fracΔ{\log Δ}$-choosable

Documenti analoghi

• Graphs of maximum average degree less than $\frac {11}{3}$ are flexibly $4$-choosable
  di: Bi, Richard, et al.
  Pubblicazione: (2024)
• On a conjecture concerning 4-coloring of graphs with one crossing
  di: Dvořák, Zdeněk, et al.
  Pubblicazione: (2025)
• Oriented Colouring Graphs of Bounded Degree and Degeneracy
  di: Clow, Alexander, et al.
  Pubblicazione: (2023)
• Strong log-convexity of genus sequences
  di: Mohar, Bojan
  Pubblicazione: (2024)
• Coloring $(P_5, \text{gem})$-free graphs with $Δ-1$ colors
  di: Cranston, Daniel W., et al.
  Pubblicazione: (2020)