Přemysl Holub

activity

20102026

most cited3-coloring triangle-free planar graphs with a precolored 9-cycle

5 citations · 8 across the 12 of their papers we have counts for

collaborators

Showing 2011Show all

2 papers · 1 filter

math.CO2011

The rainbow connection number of 2-connected graphs

Jan Ekstein, Přemysl Holub, Tomáš Kaiser +4

The rainbow connection number of a graph G is the least number of colours in a (not necessarily proper) edge-colouring of G such that every two vertices are joined by a path which…

cs.DM2011

Packing Chromatic Number of Distance Graphs

Jan Ekstein, Přemysl Holub, Bernard Lidický

The packing chromatic number $χ_{ρ} (G)$ of a graph $G$ is the smallest integer $k$ such that vertices of $G$ can be partitioned into disjoint classes $X_{1}, ..., X_{k}$ where vertices i…