16 citations · 94 across the 30 of their papers we have counts for
5 papers · 1 filter
Efficient Isomorphism for -graphs and -graphs
Deniz Ağaoğlu Çağırıcı, Petr Hliněný
An -graph is one representable as the intersection graph of connected subgraphs of a suitable subdivision of a fixed graph , introduced by Biró, Hujter and Tuza (1992). An $H…
On Colourability of Polygon Visibility Graphs
Onur Çağirici, Petr Hliněný, Bodhayan Roy
We study the problem of colouring visibility graphs of polygons. In particular, for visibility graphs of simple polygons, we provide a polynomial algorithm for 4-colouring, and pro…
Exact Crossing Number Parameterized by Vertex Cover
Petr Hliněný, Abhisekh Sankaran
We prove that the exact crossing number of a graph can be efficiently computed for simple graphs having bounded vertex cover. In more precise words, Crossing Number is in FPT when…
On conflict-free chromatic guarding of simple polygons
Onur Çağırıcı, Subir Kumar Ghosh, Petr Hliněný +1
We study the problem of colouring the vertices of a polygon, such that every viewer in it can see a unique colour. The goal is to minimise the number of colours used. This is also…
Bounded maximum degree conjecture holds precisely for -crossing-critical graphs with
Drago Bokal, Zdeněk Dvořák, Petr Hliněný +3
We study -crossing-critical graphs, which are the minimal graphs that require at least edge-crossings when drawn in the plane. For every fixed pair of integers with $c\ge 13…