Graphs of maximum average degree less than $\frac {11}{3}$ are flexibly $4$-choosable

Documenti analoghi

• Flexible list coloring of graphs with maximum average degree less than $3$
  di: Bi, Richard, et al.
  Pubblicazione: (2023)
• Bipartite graphs are $(\frac{4}{5}-\varepsilon) \fracΔ{\log Δ}$-choosable
  di: Bradshaw, Peter, et al.
  Pubblicazione: (2024)
• Proper conflict-free degree-choosability of outerplanar graphs
  di: Kashima, Masaki, et al.
  Pubblicazione: (2025)
• Remarks on proper conflict-free degree-choosability of graphs with prescribed degeneracy
  di: Kashima, Masaki, et al.
  Pubblicazione: (2025)
• Cliques in Squares of Graphs with Maximum Average Degree less than 4
  di: Cranston, Daniel W., et al.
  Pubblicazione: (2023)