Chromatic Polynomial as the Characteristic Polynomial of the Graphic Matroid is a result in [matroid theory](/page/Matroid%20Theory). It formalizes the assertion that let be a finite loopless graph, with parallel edges allowed, and let be the number of connected components of . Let be its graphic matroid. Then , where is the chromatic polynomial of.