About: http://webisa.webdatacommons.org/310014432

Property	Value
http://www.w3.org/1999/02/22-rdf-syntax-ns#type	http://www.w3.org/ns/prov#Entity
http://www.w3.org/ns/prov#value	The input to the three coloring problem is a graph G, and the problem is to decide whether the vertices of G can be colored with three colors such that no pair of adjacent vertices are colored the same color.
http://www.w3.org/ns/prov#wasQuotedFrom	factbites.com