Fractional coloring with local demands and applications to degree-sequence bounds on the independence number

Documenti analoghi

• The chromatic number of triangle-free hypergraphs
  di: Li, Lina, et al.
  Pubblicazione: (2022)
• Immersions of large cliques in graphs with independence number 2 and bounded maximum degree
  di: Botler, Fábio, et al.
  Pubblicazione: (2025)
• Fractional domatic number and minimum degree
  di: Chuet, Quentin, et al.
  Pubblicazione: (2025)
• Upper bounds on the average number of colors in the non-equivalent colorings of a graph
  di: Hertz, Alain, et al.
  Pubblicazione: (2021)
• Hamiltonian path and Hamiltonian cycle are solvable in polynomial time in graphs of bounded independence number
  di: Jedličková, Nikola, et al.
  Pubblicazione: (2023)