3 papers
cs.CG2026
k-Planar and Fan-Crossing Drawings and Transductions of Embeddable Graphs
Petr HlinÄný, Jan Jedelský
We introduce, for every surface , a two-way connection between definability of a graph class by FO transductions (first-order logical transformations) of the graph…
math.CO2026
Hereditary Graph Product Structure and -clique-width
Petr HlinÄný, Jan Jedelský
We introduce H-clique-width, a new structural measure of graphs that aims to provide a hereditary analogue of the traditional graph product structure. The definition naturally gene…
math.CO2024
Twin-width of Planar Graphs; a Short Proof
Petr HlinÄný
The fascinating question of the maximum value of twin-width on planar graphs is nowadays not far from the final resolution; there is a lower bound of 7 coming from a construction b…