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

Jungho Ahn, Seonghyuk Im, Sang-il Oum

Source record

Source: Crossref

Published: Dec 1, 2025

DOI: 10.1016/j.dam.2025.06.026

Open original source ↗

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.