{"repository":{"description":"Graph Isomorphism of graphs with bounded valence can be decided in polynomial time.","watchers":0,"stargazers":0,"forks":0,"fork":false,"size":352,"owner":"nils-wisiol","private":false,"open_issues":0,"has_issues":true,"has_downloads":true,"has_wiki":true,"language":"TeX","created_at":"2013-11-21T10:27:45-08:00","pushed_at":"2013-12-08T02:50:14-08:00","master_branch":"master"},"actor_attributes":{"type":"User","name":"Nils Wisiol","company":"Binärpiloten","email":"da39a3ee5e6b4b0d3255bfef95601890afd80709"},"url":"https://github.com/nils-wisiol/math-bachelors-thesis/compare/f8a9ec3b20...3552866376"}