First Page | Document Content | |
---|---|---|
Date: 2015-03-23 10:08:58Graph theory Mathematics Discrete mathematics Morphisms Semantic Web Knowledge representation Graph operations Blank node Cograph Graph homomorphism Graph coloring Resource Description Framework | Skolemising Blank Nodes while Preserving Isomorphism Aidan Hogan ∗ Department of Computer ScienceAdd to Reading ListSource URL: aidanhogan.comDownload Document from Source WebsiteFile Size: 416,82 KBShare Document on Facebook |
CHARLES UNIVERSITY FACULTY OF MATHEMATICS AND PHYSICS STRUCTURE AND COMPLEXITYDocID: 1r79Q - View Document | |
The homomorphism order Constrained homomorphisms Locally constrained homomorphism orders Constrained homomorphism orders Jan HubiˇckaDocID: 1r6wl - View Document | |
Part I: Introduction Part II: Solution The complexity of Sur-Hom(C∗4 ) Barnaby Martin and Dan¨ıel PaulusmaDocID: 1r6iz - View Document | |
CHARLES UNIVERSITY FACULTY OF MATHEMATICS AND PHYSICS LOCALLY INJECTIVE HOMOMORPHISMSDocID: 1r5we - View Document | |
A. Daneshgar: Extended abstract of my talk at IUTFebruaryDo Graphs Admit Topological Field Theories? Amir DaneshgarDocID: 1r2yt - View Document |