| |
| 2009 | ||
|---|---|---|
| 6 | EE | D. Gonçalves: A planar linear hypergraph whose edges cannot be represented as straight line segments. Eur. J. Comb. 30(1): 280-282 (2009) |
| 5 | EE | D. Gonçalves: Covering planar graphs with forests, one having bounded maximum degree. J. Comb. Theory, Ser. B 99(2): 314-322 (2009) |
| 2008 | ||
| 4 | EE | D. Gonçalves: On the L(p, 1)-labelling of graphs. Discrete Mathematics 308(8): 1405-1414 (2008) |
| 3 | EE | D. Gonçalves: Covering planar graphs with forests, one having a bounded maximum degree. Electronic Notes in Discrete Mathematics 31: 161-165 (2008) |
| 2007 | ||
| 2 | EE | D. Gonçalves: Caterpillar arboricity of planar graphs. Discrete Mathematics 307(16): 2112-2121 (2007) |
| 1 | EE | D. Gonçalves: On Vertex Partitions and the Colin de Verdière Parameter. Electronic Notes in Discrete Mathematics 28: 543-547 (2007) |