First Page | Document Content | |
---|---|---|
Date: 2014-08-22 14:45:03Morphisms Graph theory NP-complete problems Graph coloring Graph operations Pathwidth Graph homomorphism Treewidth Cograph Graph isomorphism Indifference graph Clique-width | Finding vertex-surjective graph homomorphisms⇤ Petr A. Golovach†, Bernard Lidick´ y‡, † Barnaby Martin, and Dani¨el Paulusma†Add to Reading ListSource URL: orion.math.iastate.eduDownload Document from Source WebsiteFile Size: 520,71 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 |