Buscar
Mostrando ítems 31-40 de 66
Artículo
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
Moore spaces in proper homotopy
(University of Tsukuba, 1995)
Moore spaces are de ned in proper homotopy theory. Some results on the existence and uniqueness of those spaces are proven. An example of two non properly equivalent Moore spaces is given.
Artículo
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
Monochromatic geometric k-factors in red-blue sets with white and Steiner points
(2009)
We study the existence of monochromatic planar geometric k-factors on sets of red and blue points. When it is not possible to find a k-factor we make use of auxiliary points: white points, whose position is given as a datum ...
Artículo
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
An aperiodic tiles machine
(2002)
The results we introduce in this work lead to get an algorithm which produces aperiodic sets of tiles using Voronoi diagrams. This algorithm runs in optimal worst-case time O(nlogn). Since a wide range of new examples can ...
Artículo
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
New results on the robust coloring problem
(Springer, 2024-03-23)
Many variations of the classical graph coloring model have been intensively studied due to their multiple applications; scheduling problems and aircraft assignments, for instance, motivate the robust coloring problem. This ...
Artículo
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
Geometric Realization of Möbius Triangulations
(2008)
A Möbius triangulation is a triangulation on the Möbius band. A geometric realization of a map M on a surface $\Sigma$ is an embedding of $\Sigma$ into a Euclidean 3-space $\mathbb{R}^3$ such that each face of M is a flat ...
Artículo
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
Computing the Tutte polynomial of Archimedean tilings
(2014)
We describe an algorithm to compute the Tutte polynomial of large fragments of Archimedean tilings by squares, triangles, hexagons and combinations thereof. Our algorithm improves a well known method for computing the Tutte ...
Artículo
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
On infinite outerplanar graphs
(Institute of Mathematics of the Czech Academy of Sciences, 1994)
In this Note, we study infinite graphs with locally finite outerplane embeddings, given a characterization by forbidden subgraphs
Artículo
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
Miscellaneous properties of embeddings of line, total and middle graphs
(2001)
Chartrand et al. (J. Combin. Theory Ser. B 10 (1971) 12–41) proved that the line graph of a graph G is outerplanar if and only if the total graph of G is planar. In this paper, we prove that these two conditions are ...
Artículo
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
Extremal Graphs without Topological Complete Subgraphs
(2004)
The exact values of the function $ex(n;TK_{p})$ are known for ${\lceil \frac{2n+5}{3}\rceil}\leq p < n$ (see [Cera, Diánez, and Márquez, SIAM J. Discrete Math., 13 (2000), pp. 295--301]), where $ex(n;TK_p)$ is the maximum ...
Artículo
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
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 ...