Die Anzahl der Faerbungen ebener Graphen

L. Friess

Let G be a finite planar connected graph without loops or multiple edges. All minimal circuits except atmost one - say C* - are triangles. Let k be the number of vertices of C*. Th…