3 citations · 6 across the 10 of their papers we have counts for
7 papers · 1 filter
New Menger-like dualities in digraphs and applications to half-integral linkages
Victor Campos, Jonas Costa, Raul Lopes +1
We present new min-max relations in digraphs between the number of paths satisfying certain conditions and the order of the corresponding cuts. We define these objects in order to…
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…
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…
Polyhedral studies of vertex coloring problems: The asymmetric representatives formulation
Victor Campos, Ricardo C. Corrêa, Diego Delle Donne +2
Despite the fact that some vertex coloring problems are polynomially solvable on certain graph classes, most of these problems are not "under control" from a polyhedral point of vi…
b-coloring graphs with large girth
Victor Campos, Victor Farias, Ana Silva
A b-coloring of a graph is a coloring of its vertices such that every color class contains a vertex that has a neighbor in all other classes. The b-chromatic number of a graph is t…
5-choosability of graphs with 2 crossings
Victor Campos, Frédéric Havet
We show that every graph with two crossings is 5-choosable. We also prove that every graph which can be made planar by removing one edge is 5-choosable.