Mostrando ítems 1-10 de 306
Coloração de Arestas em Grafos Split-Comparabilidade
(Universidade Federal de São CarlosUFSCarPrograma de Pós-Graduação em Ciência da Computação - PPGCC-SoCâmpus Sorocaba, 2017-05-02)
Let G = (V, E) be a simple and undirected graph. An edge-coloring is an assignment of colors to the edges of the graph such that any two adjacent edges receive different colors. The chromatic index of a graph G is the ...
Grafos em superfícies
(Universidade Estadual Paulista (Unesp), 2014-12-12)
The main goal of this work is to get a result on separation of surfaces by graphs. The Relative Homology is the principal tool used and we get a particular version of Lefschetz duality. For the preparation of this dissertation ...