A constraint-satisfaction problem often used as a test case in research, which also turns out to be equivalent to certain real-world problems (e.g. register allocation). Given a connected graph and a fixed number of colours, the problem is to assign a colour to each node, subject to the constraint that any two connected nodes cannot be assigned the same colour. This is an example of an NP-complete problem.
See also four colour map theorem.
[graf-eem] /ˈgræf im/ noun, Linguistics. 1. a minimal unit of a writing system. 2. a unit of a writing system consisting of all the written symbols or sequences of written symbols that are used to represent a single phoneme. /ˈɡræfiːm/ noun 1. (linguistics) one of a set of orthographic symbols (letters or combinations of letters) […]
[gra-fee-miks] /græˈfi mɪks/ noun, (used with a singular verb) Linguistics. 1. the study of writing systems and of their relation to speech.
/ˈɡræfiːn/ noun 1. a nanomaterial consisting of one-atom-thick sheets of carbon atoms, with the atoms arranged in a honeycomb lattice structure
[graf-ik] /ˈgræf ɪk/ adjective, Also, graphical 1. giving a clear and effective picture; vivid: a graphic account of an earthquake. 2. pertaining to the use of diagrams, graphs, mathematical curves, or the like; diagrammatic. 3. of, relating to, or expressed by writing: graphic symbols. 4. written, inscribed, or drawn. 5. depicted in a realistic or […]