76 citations · 127 across the 5 of their papers we have counts for
11 papers
Weak Coloring Numbers of Intersection Graphs
Zdeněk Dvořák, Jakub Pekárek, Torsten Ueckerdt +1
Weak and strong coloring numbers are generalizations of the degeneracy of a graph, where for each natural number , we seek a vertex ordering such every vertex can (weakly respec…
Space charge limited photocurrents and transient currents in CdZnTe radiation detectors
Katarina Ridzonova, Eduard Belas, Roman Grill +2
We combined steady-state photoconductivity and laser-induced transient current measurements under above-band-gap illumination to study the space charge formation in CdZnTe. Analyti…
Induced odd cycle packing number, independent sets, and chromatic number
Zdeněk Dvořák, Jakub Pekárek
The induced odd cycle packing number of a graph is the maximum integer such that contains an induced subgraph consisting of pairwise vertex-disjoint odd c…
Coloring near-quadrangulations of the cylinder and the torus
Zdeněk Dvořák, Jakub Pekárek
Let G be a simple connected plane graph and let C_1 and C_2 be cycles in G bounding distinct faces f_1 and f_2. For a positive integer l, let r(l) denote the number of integers n s…
Deep Levels and Mixed Conductivity in Organometallic Halide Perovskites
Artem Musiienko, Pavel Moravec, Roman Grill +10
Understanding the type, formation energy and capture cross section of defects is one of the challenges in the field of organometallic halide perovskite (OMHP) devices. Currently, s…
Influence of deep levels on the electrical transport properties of CdZnTeSe detectors
M Rejhon, J Franc, V Dědič +4
We investigated the influence of deep levels on the electrical transport properties of CdZnTeSe radiation detectors by comparing experimental data with numerical simulations based…
Irreducible 4-critical triangle-free toroidal graphs
Zdeněk Dvořák, Jakub Pekárek
The theory of Dvorak, Kral, and Thomas (2015) shows that a 4-critical triangle-free graph embedded in the torus has only a bounded number of faces of length greater than 4 and that…
On generalized choice and coloring numbers
Zdeněk Dvořák, Jakub Pekárek, Jean-Sébastien Sereni
A well-known result of Alon shows that the coloring number of a graph is bounded by a function of its choosability. We explore this relationship in a more general setting with rela…
On the Simultaneous Minimum Spanning Trees Problem
Matěj Konečný, Stanislav Kučera, Jana Novotná +4
Simultaneous Embedding with Fixed Edges (SEFE) is a problem where given planar graphs we ask whether they can be simultaneously embedded so that the embedding of each graph is…
Dual-wavelength Photo-Hall effect spectroscopy of deep levels in high resistive CdZnTe with negative differential photoconductivity
A. Musiienko, R. Grill, P. Moravec +6
Photo-Hall effect spectroscopy was used in the study of deep levels in high resistive CdZnTe. The monochromator excitation in the photon energy range 0.65-1.77 eV was complemented…
Minimal Sum Labeling of Graphs
Matěj Konečný, Stanislav Kučera, Jana Novotná +3
A graph is called a sum graph if there is a so-called sum labeling of , i.e. an injective function such that for every it h…