Buscar
Mostrando ítems 1-4 de 4
Artículo
The center of an infinite graph
(1996)
In this note we extend the notion of the center of a graph to infinite graphs. Thus, a vertex is in the center of the infinite graph G if it is in the center of an increasing family of finite subgraphs covering G. We give ...
Artículo
An algorithm computing homotopy groups
(Elsevier, 1996)
An algorithm computing homotopy groups of a reduced simplicial set with effective homology is described, using the Whitehead tower method.
Artículo
On the computability of the Steenrod squares
(Springer, 1996)
In questo lavoro offriamo in modo esplicito le formule di una serie de morfismi che controUano la mancanza di commutativit~ del prodotto cup a livello di cocateni, supponendo di lavorare con insiemi sempliciali; queste ...
Artículo
On a visibility representation of graphs
(1996)
We give a visibility representation of graphs which extends some very well-known representations considered extensively in the literature. Concretely, the vertices are represented by a collection of parallel hyper-rectangles ...