3 citations · 3 across the 1 of their papers we have counts for
4 papers
The number of Gallai k-colorings of complete graphs
Josefran de Oliveira Bastos, Fabricio S. Benevides, Jie Han
An edge coloring of the -vertex complete graph, , is a Gallai coloring if it does not contain any rainbow triangle, that is, a triangle whose edges are colored with three d…
Counting Gallai 3-colorings of complete graphs
Josefran de Oliveira Bastos, Fabricio Siqueira Benevides, Guilherme Oliveira Mota +1
An edge coloring of the n-vertex complete graph K_n is a Gallai coloring if it does not contain any rainbow triangle, that is, a triangle whose edges are colored with three distinc…
Edge-colorings of graphs avoiding complete graphs with a prescribed coloring
Fabricio S. Benevides, Carlos Hoppen, Rudini Menezes Sampaio
Given a graph and an integer , a partition of the edge set of into at most classes, and a graph , define as the number…
Circular Backbone Colorings: on matching and tree backbones of planar graphs
Julio Araujo, Fabricio Benevides, Alexandre Cezar +1
Given a graph , and a spanning subgraph of , a circular -backbone -coloring of is a proper -coloring of such that $q\le \lvert c(u)-c(v)\rvert \l…