O'Reilly logo
  • Sanjiv Singh thinks this is interesting:

he nodes must be drawn with at most four colors such that no connected nodes receive the same color. In short, “every planar graph is four colorable”


Cover of A Librarian's Guide to Graphs, Data and the Semantic Web


Adjacency and Traversal (computational times) are to be measured as a contributory factor.