First Page | Document Content | |
---|---|---|
Date: 2002-03-12 13:03:16Minor Arboricity Planar graph Petersen graph Line graph Hamiltonian path Neighbourhood Clique Graph homomorphism Graph theory NP-complete problems Graph coloring | Discrete Mathematics[removed]–12 www.elsevier.com/locate/discAdd to Reading ListSource URL: www.math.wvu.eduDownload Document from Source WebsiteFile Size: 76,21 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 |