Chính T. Hoàng, Problems on graph coloring
A k-coloring of a graph is an assignment of k colors to its vertices such that no two adjacent adjacent vertices receive the same color. The Coloring Problem is the …
1 event found.
기초과학연구원 이산수학그룹