◀ ▲ ▶Branches / Graphtheory / Part: Vertex Colorings and Decompositions
Part: Vertex Colorings and Decompositions
In this part, problems involving the colorings of the vertices in the graph will be considered. Many practical problems which can be modeled as graphtheoretical problems, can be reduced to vertex colorings problems, i.e. problems that involve splitting the set of vertices of a graph into disjoint subsets fulfilling particular properties.
Table of Contents
 Theorem: Brooks' Theorem
 Definition: Chromatic Number and $k$Coloring of a Graph
 Proposition: Chromatic Number and Maximum Vertex Degree
 Chapter: Colorings of Planar Graphs
Thank you to the contributors under CC BYSA 4.0!
 Github:
