An Algorithm for Subgraph Isomorphism J. R. ULLMANN

First Page		Document Content
Date: 2007-06-12 02:28:14 Algebraic graph theory Adjacency matrix Matrices Line graph Graph isomorphism Graph isomorphism problem Color-coding Graph theory Mathematics Morphisms		An Algorithm for Subgraph Isomorphism J. R. ULLMANN Add to Reading List Source URL: www.engr.uconn.edu Download Document from Source Website File Size: 744,68 KB Share Document on Facebook

	Smooth morphisms Peter Bruin 21 February 2007 Introduction The goal of this talk is to define smooth morphisms of schemes, which are one of the main ingredients in N´eron’s fundamental theorem [BLR, § 1.3, Theorem 1] DocID: 1uOZ0 - View Document
	Properties of morphisms Milan Lopuhaä May 1, Introduction This talk will be about some properties of morphisms of schemes. One of DocID: 1usUA - View Document
	RELATIVE AMPLENESS IN RIGID GEOMETRY BRIAN CONRAD We develop a rigid-analytic theory of relative ampleness for line bundles and record some applications to faithfully flat descent for morphisms and proper geometric objec DocID: 1uoYe - View Document
	arXiv:1011.5788v2 [math.CO] 6 JanPaperfolding morphisms, planefilling curves, and fractal tiles Michel Dekking January 7, 2011 DocID: 1u8vH - View Document
	New York Journal of Mathematics New York J. Math–159. Dynatomic cycles for morphisms of projective varieties Benjamin Hutz DocID: 1u7M1 - View Document