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

Abstract

A proper coloring of a graph is \emph{proper conflict-free} if every non-isolated vertex $v$ has a neighbor whose color is unique in the neighborhood of $v$. A proper coloring of a graph is \emph{odd} if for every non-isolated vertex $v$, there is a color appearing an odd number of times in the neighborhood of $v$. For an integer $k$, the \textsc{PCF $k$-Coloring} problem asks whether an input graph admits a proper conflict-free $k$-coloring and the \textsc{Odd $k$-Coloring} asks whether an input graph admits an odd $k$-coloring. We show that for every integer $k\ge 3$, both problems are NP-complete, even if the input graph is bipartite. Furthermore, we show that the \textsc{PCF $4$-Coloring} problem is NP-complete when the input graph is planar.

13 pages, 2 figures

References in corpus (5)

• Proper conflict-free and unique-maximum colorings of planar graphs with respect to neighborhoods
• A Note on Odd Colorings of 1-Planar Graphs
• On odd colorings of sparse graphs
• Proper conflict-free list-coloring, odd minors, subdivisions, and layered treewidth
• Odd colourings, conflict-free colourings and strong colouring numbers