3 citations · 3 across the 3 of their papers we have counts for
4 papers
On the pebbling numbers of Flower, Blanuša, and Watkins snarks
Matheus Adauto, Celina de Figueiredo, Glenn Hurlbert +1
Graph pebbling is a game played on graphs with pebbles on their vertices. A pebbling move removes two pebbles from one vertex and places one pebble on an adjacent vertex. The pebbl…
Most direct product of graphs are Type 1
Diane Castonguay, Celina M. H. de Figueiredo, Luis Antonio Kowada +2
A \textit{-total coloring} of a graph is an assignment of colors to its elements (vertices and edges) so that adjacent or incident elements have different colors. The to…
Revising Johnson's table for the 21st century
Celina M. H. de Figueiredo, Alexsander A. de Melo, Diana Sasaki +1
What does it mean today to study a problem from a computational point of view? We focus on parameterized complexity and on Column 16 "Graph Restrictions and Their Effect" of D. S.…
The Cost of Perfection for Matchings in Graphs
Emilio Vital Brazil, Guilherme D. da Fonseca, Celina de Figueiredo +1
Perfect matchings and maximum weight matchings are two fundamental combinatorial structures. We consider the ratio between the maximum weight of a perfect matching and the maximum…