1 citations · 1 across the 2 of their papers we have counts for
6 papers
On Layered Fan-Planar Graph Drawings
Therese Biedl, Steven Chaplick, Jiři Fiala +4
In this paper, we study fan-planar drawings that use layers and are proper, i.e., edges connect adjacent layers. We show that if the embedding of the graph is fixed, then testi…
On the edge-length ratio of 2-trees
Václav Blažej, Jiří Fiala, Giuseppe Liotta
We study planar straight-line drawings of graphs that minimize the ratio between the length of the longest and the shortest edge. We answer a question of Lazard et al. [Theor. Comp…
Reconfiguration Graph for Vertex Colourings of Weakly Chordal Graphs
Carl Feghali, Jiří Fiala
The reconfiguration graph of the -colourings of a graph contains as its vertex set the -colourings of and two colourings are joined by an edge if they differ…
On Vertex- and Empty-Ply Proximity Drawings
Patrizio Angelini, Steven Chaplick, Felice De Luca +7
We initiate the study of the vertex-ply of straight-line drawings, as a relaxation of the recently introduced ply number. Consider the disks centered at each vertex with radius equ…
Gaps in full homomorphism order
Jiří Fiala, Jan Hubička, Yangjing Long
We characterise gaps in the full homomorphism order of graphs.
Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs
Hajo Broersma, Jiří Fiala, Petr A. Golovach +3
Hung and Chang showed that for all k>=1 an interval graph has a path cover of size at most k if and only if its scattering number is at most k. They also showed that an interval gr…