M. Fiol

activity

20122026

most citedA simple and fast heuristic algorithm for edge-coloring of graphs

10 citations · 20 across the 23 of their papers we have counts for

collaborators

Showing 2024Show all

3 papers · 1 filter

math.CO2024

On bipartite biregular large graphs

G. Araujo-Pardo, C. Dalfó, M. A. Fiol +1

A bipartite graph $G = (V, E)$ with $V = V_{1} \cup V_{2}$ is biregular if all the vertices of each stable set, $V_{1}$ and $V_{2}$ , have the same degree, $r$ and $s$ , respectively. This paper s…

math.CO2024

Token graphs of Cayley graphs as lifts

C. Dalfó, M. A. Fiol, S. Pavlíková +1

This paper describes a general method for representing $k$ -token graphs of Cayley graphs as lifts of voltage graphs. This allows us to construct line graphs of circulant graphs and…

math.CO2024

Note on the product of the largest and the smallest eigenvalue of a graph

Aida Abiad, Cristina Dalfó, Miquel Àngel Fiol

In this note, we use eigenvalue interlacing to derive an inequality between the maximum degree of a graph and its maximum and minimum adjacency eigenvalues. The case of equality is…