First-Fit coloring of Cartesian product graphs and its defining sets

Ejemplares similares

• $\mathcal{O}(VE)$ time algorithms for the Grundy (First-Fit) chromatic number of block graphs and graphs with sufficiently large girth
  por: Zaker, Manouchehr
  Publicado: (2024)
• On z-coloring and ${\rm b}^{\ast}$-coloring of graphs as improved variants of the b-coloring
  por: Zaker, Manouchehr
  Publicado: (2024)
• A new vertex coloring heuristic and corresponding chromatic number
  por: Zaker, Manouchehr
  Publicado: (2020)
• Bounds for the Grundy chromatic number of graphs in terms of domination number
  por: Khaleghi, Abbas, et al.
  Publicado: (2022)
• On Grundy and b-chromatic number of some families of graphs: a comparative study
  por: Masih, Zoya, et al.
  Publicado: (2020)