10 citations · 10 across the 2 of their papers we have counts for
2 papers
math.CO2013
Some results on the structure of multipoles in the study of snarks
M. A. Fiol, J. Vilaltella
Multipoles are the pieces we obtain by cutting some edges of a cubic graph. As a result of the cut, a multipole has dangling edges with one free end, which we call semiedges. T…
math.CO2012★ 10 cited
A simple and fast heuristic algorithm for edge-coloring of graphs
M. A. Fiol, J. Vilaltella
A simple but empirically efficient heuristic algorithm for the edge-coloring of graphs is presented. Its basic idea is the displacement of "conflicts" (repeated colors in the edges…