8 citations · 42 across the 27 of their papers we have counts for
7 papers · 2 filters
The diachromatic number of digraphs
Gabriela Araujo-Pardo, Juan José Montellano-Ballesteros, Mika Olsen +1
We consider the extension to directed graphs of the concept of achromatic number in terms of acyclic vertex colorings. The achromatic number have been intensely studied since it wa…
On chromatic indices of finite affine spaces
Gabriela Araujo-Pardo, György Kiss, Christian Rubio-Montiel +1
The pseudoachromatic index of the finite affine space denoted by is the the maximum number of colors in any complete line-coloring of $\…
The 4-girth-thickness of the complete multipartite graph
Christian Rubio-Montiel
The -girth-thickness of a graph is the smallest number of planar subgraphs of girth at least whose union is . In this paper, we calculate the -girth-thick…
Complete colorings of planar graphs
M. Gabriela Araujo-Pardo, F. Esteban Contreras-Mendoza, Sara J. Murillo-García +2
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. We gi…
The 4-girth-thickness of the complete graph
Christian Rubio-Montiel
In this paper, we define the -girth-thickness of a graph as the minimum number of planar subgraphs of girth at least whose union is . We obtain the -girth…
On line colorings of finite projective spaces
Gabriela Araujo-Pardo, György Kiss, Christian Rubio-Montiel +1
In this paper, we prove lower and upper bounds on the achromatic and the pseudoachromatic indices of the -dimensional finite projective space of order .
The Hadwiger number, chordal graphs and -perfection
Christian Rubio-Montiel
A graph is chordal if every induced cycle has three vertices. The Hadwiger number is the order of the largest complete minor of a graph. We characterize the chordal graphs in terms…