14 citations · 25 across the 17 of their papers we have counts for
Showing 2015Show all
3 papers · 1 filter
cs.CG2015
The (3,1)-ordering for 4-connected planar triangulations
Therese Biedl, Martin Derka
Canonical orderings of planar graphs have frequently been used in graph drawing and other graph algorithms. In this paper we introduce the notion of an -canonical order, whi…
cs.CG2015★ 3 cited
-String -VPG Representations of Planar Partial -Trees and Some Subclasses
Therese Biedl, Martin Derka
Planar partial -trees are subgraphs of those planar graphs obtained by repeatedly inserting a vertex of degree into a face. In this paper, we show that planar partial -tr…
cs.DS2015★ 1 cited
List Colouring Big Graphs On-Line
Martin Derka, Alejandro López-Ortiz, Daniela Maftuleac
In this paper, we investigate the problem of graph list colouring in the on-line setting. We provide several results on paintability of graphs in the model introduced by Schauz [13…