3 citations · 6 across the 10 of their papers we have counts for
4 papers · 1 filter
Cycle convexity and the tunnel number of links
Júlio Araújo, Victor Campos, Darlan Girão +3
In this work, we introduce a new graph convexity, that we call Cycle Convexity, motivated by related notions in Knot Theory. For a graph , define the interval function in…
Adapting the Directed Grid Theorem into an FPT Algorithm
Victor Campos, Raul Lopes, Ana Karolinna Maia +1
The Grid Theorem of Robertson and Seymour [JCTB, 1986], is one of the most important tools in the field of structural graph theory, finding numerous applications in the design of a…
Coloring Problems on Bipartite Graphs of Small Diameter
Victor A. Campos, Guilherme C. M. Gomes, Allen Ibiapina +3
We investigate a number of coloring problems restricted to bipartite graphs with bounded diameter. First, we investigate the -List Coloring, List -Coloring, and -Precolori…
Edge-Disjoint Branchings in Temporal Graphs
Victor Campos, Raul Lopes, Andrea Marino +1
A temporal digraph is a triple where is a digraph, is a function on that tells us the timestamps when a vertex is active, and is a functio…