Editing Graph theory (section)

=== Graph coloring ===
{{main|Graph coloring}}
Many problems and theorems in graph theory have to do with various ways of coloring graphs. Typically, one is interested in coloring a graph so that no two adjacent vertices have the same color, or with other similar restrictions. One may also consider coloring edges (possibly so that no two coincident edges are the same color), or other variations. Among the famous results and conjectures concerning graph coloring are the following:
* [[Four-color theorem]]
* [[Strong perfect graph theorem]]
* [[Erdős–Faber–Lovász conjecture]] 
* [[Total coloring|Total coloring conjecture]], also called [[Mehdi Behzad|Behzad]]'s conjecture (unsolved)
* [[List edge-coloring|List coloring conjecture]] (unsolved)
* [[Hadwiger conjecture (graph theory)]] (unsolved)