Facultad de Estudios Superiores Acatlán

output

20152022

most citedOn the pseudoachromatic index of the complete graph III

8 citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

collaborating institutions

Showing math.COShow all

11 papers · 1 filter

math.CO2022★ 2 cited

On the harmonious chromatic number of graphs

Gabriela Araujo-Pardo, Juan José Montellano-Ballesteros, Mika Olsen +1

The harmonious chromatic number of a graph $G$ is the minimum number of colors that can be assigned to the vertices of $G$ in a proper way such that any two distinct edges have dif…

math.CO2020

Motions of a connected subgraph representing a swarm of robots inside a graph of work stations

Aarón Atilano, Sebastian Bejos, Christian Rubio-Montiel

Imagine that a swarm of robots is given, these robots must communicate with each other, and they can do so if certain conditions are met. We say that the swarm is connected if ther…

math.CO2020

Achromatic numbers of Kneser graphs

Gabriela Araujo-Pardo, Juan Carlos Díaz-Patiño, Christian Rubio-Montiel

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 comes from…

math.CO2019★ 1 cited

Extremal regular graphs of given chromatic number

Christian Rubio-Montiel

We define an extremal $(r ∣ χ)$ -graph as an $r$ -regular graph with chromatic number $χ$ of minimum order. We show that the Tur{\' a}n graphs $T_{ak, k}$ , the antihole graphs and the g…

math.CO2018★ 1 cited

On crossing families of complete geometric graphs

Dolores Lara, Christian Rubio-Montiel

A crossing family is a collection of pairwise crossing segments, this concept was introduced by Aronov et. al. (1994). They prove that any set of $n$ points (in general position) i…

math.CO2017★ 1 cited

The 6-girth-thickness of the complete graph

Héctor Castañeda-López, Pablo C. Palomino, Andrea B. Ramos-Tort +2

The $g$ -girth-thickness $θ (g, G)$ of a graph $G$ is the minimum number of planar subgraphs of girth at least $g$ whose union is $G$ . In this paper, we determine the $6$ -girth-thickn…

math.CO2017★ 1 cited

Covering and 2-degree-packing numbers in graphs

Carlos Alfaro Montufar, Christian Rubio Montiel, Adrián Vázquez-Ávila

In this paper, we give a relationship between the covering number of a simple graph $G$ , $β (G)$ , and a new parameter associated to $G$ which is called 2-degree-packing number of $G…

math.CO2017★ 5 cited

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…

math.CO2017★ 3 cited

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 $n$ -dimensional finite projective space of order $q$ .

math.CO2016

Coloring decompositions of complete geometric graphs

Clemens Huemer, Dolores Lara, Christian Rubio-Montiel

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 subgra…

math.CO2015★ 8 cited

On the pseudoachromatic index of the complete graph III

G. Araujo-Pardo, J. J. Montellano-Ballesteros, C. Rubio-Montiel +1

Let $Π_{q}$ be the projective plane of order $q$ , let $ψ (m) := ψ (L (K_{m}))$ the pseudoachromatic number of the complete line graph of order $m$ , let $ a\in \{ 3,4,\dots,\tfrac{q}{2…