The crossing number is a popular tool in graph drawing and visualization, but there is not
really just one crossing number; there is a large family of crossing number notions of which …

A vertex coloring of a graph is said to be pseudocomplete if, for any two distinct colors, there
exists at least one edge with those two colors as its end vertices. The pseudoachromatic …

In this paper, we study the achromatic and the pseudoachromatic numbers of planar and
outerplanar graphs as well as planar graphs of girth 4 and graphs embedded on a surface …

Let P be a finite set of points in general position in the plane. The disjointness graph of
segments D (P) of P is the graph whose vertices are all the closed straight line segments …

La Teorıa de Gráficas es ampliamente utilizada para modelar algunos problemas
computaciones, tales como: el problema del agente viajero, coloración de mapas, etc. La …

A decomposition of a non-empty simple graph G is a pair G, P such that P is a set of non-
empty induced subgraphs of G, and every edge of G belongs to exactly one subgraph in P …

Complete colorings have the property that any two color classes has at least an edge
between them. Parameters such as the Grundy, achromatic and pseudoachromatic numbers …

Un triángulo está determinado por tres vértices y tres aristas que unen dichos vértices. La
gráfica de intersección de triángulos es una gráfica definida a partir de un conjunto de …

The achromatic number α of a graph is the largest number of colors that can be assigned to
its vertices such that adjacent vertices have different color and every pair of different colors …

Un triángulo está determinado por tres vértices y tres aristas que unen dichos vértices. La
gráfica de intersección de triángulos es una gráfica definida a partir de un conjunto de …