8 citations · 42 across the 27 of their papers we have counts for
4 papers · 1 filter
Pseudoachromatic and connected-pseudoachromatic indices of the complete graph
G. Araujo-Pardo, C. Rubio-Montiel
A complete -coloring of a graph is a (not necessarily proper) -coloring of the vertices of , such that each pair of different colors appears in an edge. A complete …
A note on the Erdös-Faber-Lovász Conjecture: quasigroups and complete digraphs
Gabriela Araujo-Pardo, Christian Rubio-Montiel, Adrian Vazquez-Avila
A decomposition of a simple graph is a pair where is a set of subgraphs of , which partitions the edges of in the sense that every edge of belongs to exa…
On the pseudoachromatic index of the complete graph III
G. Araujo-Pardo, J. J. Montellano-Ballesteros, C. Rubio-Montiel +1
Let be the projective plane of order , let the pseudoachromatic number of the complete line graph of order , let $ a\in \{ 3,4,\dots,\tfrac{q}{2…
On -Perfect Graphs
G. Araujo-Pardo, C. Rubio-Montiel
In this paper, we generalize the concept of {\it{perfect graphs}} to other parameters related to graph vertex coloring. This idea was introduced by Christen and Selkow in 1979 and…