18 citations · 50 across the 37 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
cs.DM2012
Relaxing the Constraints of Clustered Planarity
Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista +3
In a drawing of a clustered graph vertices and edges are drawn as points and curves, respectively, while clusters are represented by simple closed regions. A drawing of a clustered…
math.CO2012★ 18 cited
Nonrepetitive Colourings of Planar Graphs with Colours
Vida Dujmović, Fabrizio Frati, Gwenaël Joret +1
A vertex colouring of a graph is \emph{nonrepetitive} if there is no path for which the first half of the path is assigned the same sequence of colours as the second half. The \emp…