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

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Ahn, Jungho, Im, Seonghyuk, Oum, Sang-il
Format:	Preprint
Published:	2022
Subjects:	Computational Complexity Combinatorics 05C15, 68Q17
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Internet

https://arxiv.org/abs/2208.08330