F. Benevides

activity

20132026

most citedThe number of Gallai k-colorings of complete graphs

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

collaborators

Showing 2016Show all

2 papers · 1 filter

math.CO2016

Edge-colorings of graphs avoiding complete graphs with a prescribed coloring

Fabricio S. Benevides, Carlos Hoppen, Rudini Menezes Sampaio

Given a graph $F$ and an integer $r \geq 2$ , a partition $F$ of the edge set of $F$ into at most $r$ classes, and a graph $G$ , define $c_{r, F} (G)$ as the number…

cs.DM2016

Circular Backbone Colorings: on matching and tree backbones of planar graphs

Julio Araujo, Fabricio Benevides, Alexandre Cezar +1

Given a graph $G$ , and a spanning subgraph $H$ of $G$ , a circular $q$ -backbone $k$ -coloring of $(G, H)$ is a proper $k$ -coloring $c$ of $G$ such that $q\le \lvert c(u)-c(v)\rvert \l…