Christian Rubio-Montiel

Prof. Dr. Christian Rubio-Montiel

orcid

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
14 March 2014 in Boletín de la Sociedad Matemática Mexicana
Verified
Journal Article
Closed access
PDF file
MAM. Gabriela Araujo-Pardo
M. Gabriela Araujo-Pardo
JMJuan José Montellano-Ballesteros
Juan José Montellano-Ballesteros
Christian Rubio-MontielChristian Rubio-Montiel
Christian Rubio-Montiel
RSRicardo Strausz
Ricardo Strausz

28 July 2015 in Graphs and Combinatorics
Verified
Journal Article
Closed access
PDF file
OAO. Aichholzer
O. Aichholzer
GAG. Araujo-Pardo
G. Araujo-Pardo
NGN. García-Colín
N. García-Colín
THT. Hackl
T. Hackl
DLD. Lara
D. Lara
JUJ. Urrutia
J. Urrutia

12 July 2018 in The Electronic Journal of Combinatorics
Verified
Journal Article
Open access
PDF file
GAGabriela Araujo-Pardo
Gabriela Araujo-Pardo
JMJuan José Montellano-Ballesteros
Juan José Montellano-Ballesteros
MOMika Olsen
Mika Olsen
Christian Rubio-MontielChristian Rubio-Montiel
Christian Rubio-Montiel
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 was introduced by Harary, Hedetniemi and Prins in 1967. The dichromaticnumber is a generalization of the chromatic number for digraphs defined by Neumann-Lara in 1982. A coloring of a digraph is an acyclic coloring if each subdigraph induced by each chromatic class is acyclic, and a coloring is complete if for any pair of chromatic classes $x,y$, there is an arc from $x$ to $y$ and an arc from $y$ to $x$. The dichromatic and diachromatic numbers are, respectively, the smallest and the largest number of colors in a complete acyclic coloring. We give some general results for the diachromatic number and study it for tournaments. We also show that the interpolation property for complete acyclic colorings does hold and establish Nordhaus-Gaddum relations.

1 April 2015 in Electronic Journal of Graph Theory and Applications
Verified
Journal Article
Open access
PDF file
Christian Rubio-MontielChristian Rubio-Montiel
Christian Rubio-Montiel
UMUniversidad Nacional Aut´onoma de M´exico Instituto de Matem´aticas
Universidad Nacional Aut´onoma de M´exico Instituto de Matem´aticas
A graph $G$ is \emph{trivially perfect} if for every induced subgraph the cardinality of the largest set of pairwise nonadjacent vertices (the stability number) $\alpha(G)$ equals the number of (maximal) cliques $m(G)$. We characterize the trivially perfect graphs in terms of vertex-coloring and we extend some definitions to infinite graphs.

1 February 2019 in Discrete Applied Mathematics
Verified
Journal Article
Closed access
GAG. Araujo-Pardo
G. Araujo-Pardo
FCF.E. Contreras-Mendoza
F.E. Contreras-Mendoza
SMS.J. Murillo-García
S.J. Murillo-García
ARA.B. Ramos-Tort
A.B. Ramos-Tort
Christian Rubio-MontielChristian Rubio-Montiel
Christian Rubio-Montiel

2 January 2020 in AKCE International Journal of Graphs and Combinatorics
Verified
Journal Article
Open access
CACarlos A. Alfaro
Carlos A. Alfaro
GAGabriela Araujo-Pardo
Gabriela Araujo-Pardo
Christian Rubio-MontielChristian Rubio-Montiel
Christian Rubio-Montiel
AVAdrián Vázquez-Ávila
Adrián Vázquez-Ávila