"The proper conflict-free $k$-coloring problem and the odd $k$-coloring ..."

Jungho Ahn, Seonghyuk Im, Sang-il Oum (2022)

> Home

Details and statistics

DOI: 10.48550/ARXIV.2208.08330

access: open

type: Informal or Other Publication

metadata version: 2022-08-22

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2208-08330
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2208-08330
Jungho Ahn, Seonghyuk Im, Sang-il Oum:
The proper conflict-free $k$-coloring problem and the odd $k$-coloring problem are NP-complete on bipartite graphs. CoRR abs/2208.08330 (2022)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.