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

Ejemplares similares

• On 3-Coloring of $(2P_4,C_5)$-Free Graphs
  por: Jelínek, Vít, et al.
  Publicado: (2020)
• On the structure of (dart, odd hole)-free graphs
  por: Hoàng, Chính T.
  Publicado: (2025)
• Corrigendum to "On the monophonic rank of a graph" [Discrete Math. Theor. Comput. Sci. 24:2 (2022) #3]
  por: Dourado, Mitre C., et al.
  Publicado: (2023)
• $\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)