23 citations · 60 across the 50 of their papers we have counts for
13 papers · 1 filter
Redicolouring digraphs: directed treewidth and cycle-degeneracy
Nicolas Nisse, Lucas Picasarri-Arrieta, Ignasi Sau
Given a digraph on vertices and a vertex , the cycle-degree of is the minimum size of a set intersecting every directed…
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…
k-apices of minor-closed graph classes. I. Bounding the obstructions
Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
Let be a minor-closed graph class. We say that a graph is a -apex of if contains a set of at most vertices such that b…
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…
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…
Uniquely restricted matchings and edge colorings
Julien Baste, Dieter Rautenbach, Ignasi Sau
A matching in a graph is uniquely restricted if no other matching covers exactly the same set of vertices. This notion was defined by Golumbic, Hirst, and Lewenstein and studied in…