On Grundy and b-chromatic number of some families of graphs: a comparative study

Documents similaires

• Bounds for the Grundy chromatic number of graphs in terms of domination number
  par: Khaleghi, Abbas, et autres
  Publié: (2022)
• $\mathcal{O}(VE)$ time algorithms for the Grundy (First-Fit) chromatic number of block graphs and graphs with sufficiently large girth
  par: Zaker, Manouchehr
  Publié: (2024)
• More results on the $z$-chromatic number of graphs
  par: Khaleghi, Abbas, et autres
  Publié: (2023)
• A new vertex coloring heuristic and corresponding chromatic number
  par: Zaker, Manouchehr
  Publié: (2020)
• On z-coloring and ${\rm b}^{\ast}$-coloring of graphs as improved variants of the b-coloring
  par: Zaker, Manouchehr
  Publié: (2024)