Upper bounds for vertex degrees of planar 5-chromatic graphs

Lee W. Johnson · Transactions of the American Mathematical Society · 1973

Upper bounds are given for the degrees of vertices in planar 5 5 -chromatic graphs. Some inequalities are derived for irreducible graphs which restrict the type of planar graphs that can be irreducible.

Read the paper · More papers on PaperTik