3 citations · 7 across the 9 of their papers we have counts for
9 papers
Building a larger class of graphs for efficient reconfiguration of vertex colouring
Therese Biedl, Anna Lubiw, Owen Merkel
A -colouring of a graph is an assignment of at most colours to the vertices of so that adjacent vertices are assigned different colours. The reconfiguration graph of…
Are highly connected 1-planar graphs Hamiltonian?
Therese Biedl
It is well-known that every planar 4-connected graph has a Hamiltonian cycle. In this paper, we study the question whether every 1-planar 4-connected graph has a Hamiltonian cycle.…
Finding big matchings in planar graphs quickly
Therese Biedl
It is well-known that every -vertex planar graph with minimum degree 3 has a matching of size at least . But all proofs of this use the Tutte-Berge-formula for the…
Maximum Matchings and Minimum Blocking Sets in -Graphs
Therese Biedl, Ahmad Biniaz, Veronika Irvine +3
-Graphs graphs are important geometric graphs that have many applications especially in wireless sensor networks. They are equivalent to Delaunay graphs where empty equilatera…
Splitting -VPG graphs into outer-string and co-comparability graphs
Martin Derka, Therese Biedl
In this paper, we show that any -VPG graph (i.e., an intersection graph of orthogonal curves with at most 2 bends) can be decomposed into outerstring graphs or $O(…
Order-preserving 1-string representations of planar graphs
Therese Biedl, Martin Derka
This paper considers 1-string representations of planar graphs that are order-preserving in the sense that the order of crossings along the curve representing vertex is the sam…