The proper conflict-free $k$-coloring problem and the odd $k$-coloring problem are NP-complete on bipartite graphs

Documenti analoghi

• On 3-colorability of (claw, diamond)-free graphs
  di: Hodur, Nadzieja, et al.
  Pubblicazione: (2026)
• Quantum computing algorithms for inverse problems on graphs and an NP-complete inverse problem
  di: Ilmavirta, Joonas, et al.
  Pubblicazione: (2023)
• Results on three problems on isolation of graphs
  di: Borg, Peter, et al.
  Pubblicazione: (2026)
• The Separation of $NP$ and $PSPACE$
  di: Lin, Tianrong
  Pubblicazione: (2021)
• A Study of NP-Completeness and Undecidable Word Problems in Semigroups
  di: Abdullah, Duaa, et al.
  Pubblicazione: (2025)