Buscar
Mostrando ítems 1-6 de 6
Artículo
On Sedlacek's C-Graphs
(Societatea de Științe Matematice din România, 1993)
In this Note, we study some properties of Sedlacek's C-graphs (see [3], [4] and [5]). In particular, we give new methods to build infinite families of C-graphs starting by a C-graph, and we study the relationship between ...
Artículo
The Size of a Graph Without Topological Complete Subgraphs
(2000)
In this note we show a new upperbound for the function ex(n;TKp), i.e., the maximum number of edges of a graph of order n not containing a subgraph homeomorphic to the complete graph of order p. Further, for ${\left \lceil ...
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
A link between menger’s theorem and infinite euler graphs
(Akadémiai Kiadó, 1997)
Artículo
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
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 ...