{ "items" : [
    { "id" : "http://dbpedia.org/resource/Road_coloring_theorem"
      "properties" : {
        "http://www.w3.org/2000/01/rdf-schema#comment" : [ "In graph theory the road coloring theorem, known until recently as the road coloring conjecture, deals with synchronized instructions. The issue involves whether by using such instructions, one can reach or locate an object or destination from any other point within a network (which might be a representation of city streets or a maze)." ] ,
        "http://xmlns.com/foaf/0.1/depiction" : [ "http://commons.wikimedia.org/wiki/Special:FilePath/Road_coloring_conjecture.svg" ] ,
        "http://dbpedia.org/ontology/thumbnail" : [ "http://commons.wikimedia.org/wiki/Special:FilePath/Road_coloring_conjecture.svg?width=300"] } } }
