115 citations · 178 across the 20 of their papers we have counts for
26 papers
3-colorable planar graphs have an intersection segment representation using 3 slopes
Daniel Gonçalves
In his PhD Thesis, E.R. Scheinerman conjectured that planar graphs are intersection graphs of line segments in the plane. This conjecture was proved with two different approaches b…
Williams' Conjecture holds for meteor graphs
L. G. Cordeiro, E. Gillaspy, D. Goncalves +1
A meteor graph is a connected graph with no sources and sinks consisting of two disjoint cycles and the paths connecting these cycles. We prove that two meteor graphs are shift equ…
Contact graphs of boxes with unidirectional contacts
Daniel Gonçalves, Vincent Limouzy, Pascal Ochem
This paper is devoted to the study of particular geometrically defined intersection classes of graphs. Those were previously studied by Magnant and Martin, who proved that these gr…
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…
On Comparable Box Dimension
Zdenek Dvorák, Daniel Goncalves, Abhiruk Lahiri +2
Two boxes in are comparable if one of them is a subset of a translation of the other one. The comparable box dimension of a graph is the minimum integer such…
Homothetic triangle representations of planar graphs
Daniel Gonçalves, Benjamin Lévêque, Alexandre Pinlou
We prove that every planar graph is the intersection graph of homothetic triangles in the plane.