Constricting the Computational Complexity Gap of the $4$-Coloring Problem in $(P_t,C_3)$-free Graphs

Documents similaires

• On 3-Coloring of $(2P_4,C_5)$-Free Graphs
  par: Jelínek, Vít, et autres
  Publié: (2020)
• On the structure of (dart, odd hole)-free graphs
  par: Hoàng, Chính T.
  Publié: (2025)
• Corrigendum to "On the monophonic rank of a graph" [Discrete Math. Theor. Comput. Sci. 24:2 (2022) #3]
  par: Dourado, Mitre C., et autres
  Publié: (2023)
• $\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)
• On z-coloring and ${\rm b}^{\ast}$-coloring of graphs as improved variants of the b-coloring
  par: Zaker, Manouchehr
  Publié: (2024)