Concepedia

The book thickness of a graph

Frank R. Bernhart, Paul C. Kainen

Journal of Combinatorial Theory Series B · 1979 · 357 citations · 3 references

DOI

Concepts

References

3

Every planar map is four colorable. Part I: Discharging

K. I. Appel, Wolfgang Haken · Illinois Journal of Mathematics · 1977 · 870 citations

, , +2

Every planar map is four colorable. Part II: Reducibility

K. I. Appel, Wolfgang Haken, J. Koch · Illinois Journal of Mathematics · 1977 · 701 citations · Full text

An inequality for the chromatic number of a graph

G Szekeres, Herbert S. Wilf · Journal of Combinatorial Theory · 1968 · 210 citations

, , +3