activity
20152021
most citedA note on Erdös-Faber-Lovász Conjecture and edge coloring of complete graphs

7 citations · 12 across the 6 of their papers we have counts for

collaborators

7 papers

math.CO2021★ 2 cited

On transversal numbers of intersecting straight line systems and intersecting segment systems

Adrián Vázquez Ávila

An intersecting -uniform straight line system is an intersecting linear system whose lines consist of points on straight line segment of and any two lines sha…

math.CO2019★ 1 cited

On strong Skolem starters

Adrián Vázquez-Ávila

In this note we present an alternative (simple) construction of cardioidal starters (strong and Skolem) for , where (mod 8) is an odd prime number and…

math.CO2017★ 1 cited

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 $\…

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 , , and a new parameter associated to which is called 2-degree-packing number of $G…

math.CO2017

Domination and 2-degree-packing numbers in graphs

Adrián Vázquez-Ávila

A dominating set of a graph is a set such that \-every vertex of is either in or is adjacent to a vertex in . The domination number of , ,…

math.CO2016★ 7 cited

A note on Erdös-Faber-Lovász Conjecture and edge coloring of complete graphs

Gabriela Araujo-Pardo, Adrián Vázquez-Ávila

A linear hypergraph is intersecting if any two different edges have exactly one common vertex and an -quasicluster is an intersecting linear hypergraph with edges each one c…

math.CO2015

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…