$\mathcal{O}(VE)$ time algorithms for the Grundy (First-Fit) chromatic number of block graphs and graphs with sufficiently large girth

Ähnliche Einträge

• On z-coloring and ${\rm b}^{\ast}$-coloring of graphs as improved variants of the b-coloring
  von: Zaker, Manouchehr
  Veröffentlicht: (2024)
• More relations between $λ$-labeling and Hamiltonian paths with emphasis on line graph of bipartite multigraphs
  von: Zaker, Manouchehr
  Veröffentlicht: (2021)
• On irreversible spread of influence in edge-weighted graphs
  von: Zaker, Manouchehr
  Veröffentlicht: (2019)
• More algorithmic results for problems of spread of influence in edge-weighted graphs with and without incentives
  von: Askari, Siavash, et al.
  Veröffentlicht: (2024)
• Graph theoretic and algorithmic aspect of the equitable coloring problem in block graphs
  von: Furmańczyk, Hanna, et al.
  Veröffentlicht: (2020)