Следене
Daniel Gonçalves
Daniel Gonçalves
LIRMM, CNRS, Université de Montpellier
Потвърден имейл адрес: lirmm.fr - Начална страница
Заглавие
Позовавания
Позовавания
Година
On the L (p, 1)-labelling of graphs
D Gonçalves
Discrete Mathematics 308 (8), 1405-1414, 2008
1812008
The domination number of grids
D Gonçalves, A Pinlou, M Rao, S Thomassé
SIAM Journal on Discrete Mathematics 25 (3), 1443-1453, 2011
1282011
Every planar graph is the intersection graph of segments in the plane
J Chalopin, D Gonçalves
Proceedings of the forty-first annual ACM symposium on Theory of computing …, 2009
1072009
Triangle contact representations and duality
D Gonçalves, B Lévêque, A Pinlou
Discrete & Computational Geometry 48 (1), 239-254, 2012
552012
Entropy compression method applied to graph colorings
D Gonçalves, M Montassier, A Pinlou
arXiv preprint arXiv:1406.4380, 2014
542014
Edge partition of planar sraphs into two outerplanar graphs
D Gonçalves
Proceedings of the thirty-seventh annual ACM Symposium on Theory of …, 2005
502005
Covering planar graphs with forests, one having bounded maximum degree
D Gonçalves
Journal of Combinatorial Theory, Series B 99 (2), 314-322, 2009
452009
Planar graphs as L-intersection or L-contact graphs
D Gonçalves, L Isenmann, C Pennarun
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
372018
Toroidal maps: Schnyder woods, orthogonal surfaces and straight-line representations
D Gonçalves, B Lévêque
Discrete & Computational Geometry 51 (1), 67-131, 2014
352014
Planar graphs have 1-string representations
J Chalopin, D Gonçalves, P Ochem
Discrete & Computational Geometry 43 (3), 626, 2010
322010
Planar graphs are in 1-STRING
J Chalopin, D Gonçalves, P Ochem
Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete …, 2007
282007
Caterpillar arboricity of planar graphs
D Gonçalves
Discrete mathematics 307 (16), 2112-2121, 2007
252007
Encoding toroidal triangulations
V Despré, D Gonçalves, B Lévêque
Discrete & Computational Geometry 57 (3), 507-544, 2017
212017
The maximum clique problem in multiple interval graphs
MC Francis, D Gonçalves, P Ochem
Algorithmica 71 (4), 812-836, 2015
202015
On star and caterpillar arboricity
D Gonçalves, P Ochem
Discrete mathematics 309 (11), 3694-3702, 2009
182009
On triangles in‐minor free graphs
B Albar, D Gonçalves
Journal of Graph Theory 88 (1), 154-173, 2018
132018
Locally identifying coloring in bounded expansion classes of graphs
D Gonçalves, A Parreau, A Pinlou
Discrete Applied Mathematics 161 (18), 2946-2951, 2013
122013
Diamond-free circle graphs are Helly circle
J Daligault, D Gonçalves, M Rao
Discrete Mathematics 310 (4), 845-849, 2010
122010
On oriented labelling parameters
D Gonçalves, A Raspaud, MA Shalu
Formal Models, Languages and Applications, 34-45, 2006
122006
On triangles in K_r-minor free graphs
B Albar, D Gonçalves
arXiv preprint arXiv:1304.5468, 2013
112013
Системата не може да изпълни операцията сега. Опитайте отново по-късно.
Статии 1–20