상세 보기
The proper conflict-free k-coloring problem and the odd k-coloring problem are NP-complete on bipartite graphs
- 제목
- The proper conflict-free k-coloring problem and the odd k-coloring problem are NP-complete on bipartite graphs
- 저자
- 안정호
- 학회명
- 2022 Combinatorics Workshop
- 학회 개최일
- 2022-09-30 ~ 2022-10-01