115 citations · 178 across the 20 of their papers we have counts for
7 papers · 1 filter
Partitioning into degenerate graphs in linear time
Timothée Corsini, Quentin Deschamps, Carl Feghali +3
Let be a connected graph with maximum degree distinct from . Generalizing Brooks' Theorem, Borodin, Kostochka and Toft proved that if are…
Every Collinear Set in a Planar Graph Is Free
Vida Dujmović, Fabrizio Frati, Daniel Gonçalves +2
We show that if a planar graph has a plane straight-line drawing in which a subset of its vertices are collinear, then for any set of points, , in the plane with $|X|=|S…
The -strong induced arboricity of a graph
Maria Axenovich, Daniel Goncalves, Jonathan Rollin +1
The induced arboricity of a graph is the smallest number of induced forests covering the edges of . This is a well-defined parameter bounded from above by the number of edge…
Coloring non-crossing strings
Louis Esperet, Daniel Gonçalves, Arnaud Labourel
For a family of geometric objects in the plane , define as the least integer such that the elements of can be…
Detecting minors in matroids through triangles
Boris Albar, Daniel Gonçalves, Jorge L. Ramírez Alfonsín
In this note we investigate some matroid minor structure results. In particular, we present sufficient conditions, in terms of {\em triangles}, for a matroid to have either $U_{2,4…
Orienting triangulations
Boris Albar, Daniel Gonçalves, Kolja Knauer
We prove that any triangulation of a surface different from the sphere and the projective plane admits an orientation without sinks such that every vertex has outdegree divisible b…