Graph coloring/Related Articles
Jump to navigation
Jump to search
- See also changes related to Graph coloring, or pages that link to Graph coloring or to this page or whose text contains "Graph coloring".
Parent topics
Subtopics
Bot-suggested topics
Auto-populated based on Special:WhatLinksHere/Graph coloring. Needs checking by a human.
- Recurrence relation [r]: A relation between an entry in a sequence of numbers or other mathematical objects and preceding entries in the sequence. [e]
- Register allocation by graph coloring [r]: Add brief definition or description
- Register allocation [r]: Add brief definition or description
- Four color theorem [r]: (A famous mathematical statement with a long history) For every planar graph, four colors suffice to color its vertices in such a way that adjacent vertices have different colors. [e]
- Purebred [r]: Cultivated varieties or cultivars of an animal species, achieved through the process of selective breeding of individuals of unmixed lineage over many generations. [e]
- Sum-of-divisors function [r]: The function whose value is the sum of all positive divisors of a given positive integer. [e]
- Square root of two [r]: The positive real number that, when multiplied by itself, gives the number 2. [e]