Crystallizations and other manifold representations.
Luigi Grasselli (1987)
Disertaciones Matemáticas del Seminario de Matemáticas Fundamentales
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Effective reduction of Goresky-Kottwitz-MacPherson graphs.”
Crystallizations and other manifold representations.
3-manifold spines and bijoins.
Luigi Grasselli (1990)
Revista Matemática de la Universidad Complutense de Madrid
Similarity:
We describe a combinatorial algorithm for constructing all orientable 3-manifolds with a given standard bidimensional spine by making use of the idea of bijoin (Bandieri and Gagliardi (1982), Graselli (1985)) over a suitable pseudosimplicial triangulation of the spine.
Quadrilateral embeddings of the conjunction of graphs
Vladimír Železník (1988)
Mathematica Slovaca
Similarity:
An equivalence criterion for 3-manifolds.
M. R. Casali (1997)
Revista Matemática de la Universidad Complutense de Madrid
Similarity:
Within geometric topology of 3-manifolds (with or without boundary), a representation theory exists, which makes use of 4-coloured graphs. Aim of this paper is to translate the homeomorphism problem for the represented manifolds into an equivalence problem for 4-coloured graphs, by means of a finite number of graph-moves, called dipole moves. Moreover, interesting consequences are obtained, which are related with the same problem in the n-dimensional setting.
Homomorphisms of complete n-partite graphs.
Girse, Robert D. (1986)
International Journal of Mathematics and Mathematical Sciences
Similarity:
On the Extension of Graphs with a Given Diameter without Superfluous Edges
Ferdinand Gliviak, Peter Kyš, Ján Plesník (1969)
Matematický časopis
Similarity:
Supermagic Graphs Having a Saturated Vertex
Jaroslav Ivančo, Tatiana Polláková (2014)
Discussiones Mathematicae Graph Theory
Similarity:
A graph is called supermagic if it admits a labeling of the edges by pairwise different consecutive integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex. In this paper we establish some conditions for graphs with a saturated vertex to be supermagic. Inter alia we show that complete multipartite graphs K1,n,n and K1,2,...,2 are supermagic.