Last Updated:2025/11/20

(graph theory) The smallest number of colours needed to colour a given graph (i.e., to assign a colour to each vertex such that no two vertices connected by an edge have the same colour).

音声機能が動作しない場合はこちらをご確認ください
See correct answer

chromatic number

Edit Histories(0)

Dictionary quizzes to help you remember vocabulary

Edit Histories(0)

Login / Sign up

 

Download the app!
DiQt

DiQt

Free

★★★★★★★★★★