英语词汇“n-colorable graph”的英英意思、用法、释义、翻译、读音、例句、短语、词组-英语词典-现代词典

单词	n-colorable graph
释义	n-colorable graph n-colorable graph [¦en ‚kəl·ə·rə·bəl ′graf] (mathematics) A graph whose nodes can be colored using one of n colors on each node in such a way that no edge connects a pair of nodes with the same color.
随便看	betimol beti, mongo betioky beti-pahuin be tipping down be tipping (it) down be tipping it down be tired and emotional be tired of be tired of doing something be tired of (something) be tired of something be tired to death be tired to death of be tired to death of (something) be tired to death of something betise betitle betiyann ghar ki lakshmi betj betjeman betjeman john betjeman, sir john be-tkd betke-kleihauer test

英语词典包含2567994条英英释义在线翻译词条，基本涵盖了全部常用单词的英英翻译及用法，是英语学习的有利工具。