4 citations · 4 across the 1 of their papers we have counts for
5 papers
Structure and generation of crossing-critical graphs
ZdenÄk DvoÅák, Petr HlinÄný, Bojan Mohar
We study -crossing-critical graphs, which are the minimal graphs that require at least edge-crossings when drawn in the plane. For there are only two such graphs witho…
Computational Complexity of Covering Two-vertex Multigraphs with Semi-edges
Jan Bok, JiÅà Fiala, Petr HlinÄný +2
We initiate the study of computational complexity of graph coverings, aka locally bijective graph homomorphisms, for {\em graphs with semi-edges}. The notion of graph covering is a…
Minimizing an Uncrossed Collection of Drawings
Petr HlinÄný, Tomáš MasaÅÃk
In this paper, we introduce the following new concept in graph drawing. Our task is to find a small collection of drawings such that they all together satisfy some property that is…
Stack and Queue Numbers of Graphs Revisited
Petr HlinÄný, Adam Straka
A long-standing question of the mutual relation between the stack and queue numbers of a graph, explicitly emphasized by DujmoviÄ and Wood in 2005, was "half-answered" by DujmoviÄ…
Complexity of Anchored Crossing Number and Crossing Number of Almost Planar Graphs
Petr HlinÄný
In this paper we deal with the problem of computing the exact crossing number of almost planar graphs and the closely related problem of computing the exact anchored crossing numbe…