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 |