University of West Bohemia in Pilsen

output

20042026

most citedSciPy 1.0--Fundamental Algorithms for Scientific Computing in Python

40.2k citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

collaborating institutions

Showing 2011Show all

4 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…

math.CO2011

Long paths and cycles passing through specified vertices under the average degree condition

Binlong Li, Bo Ning, Shenggui Zhang

Let $G$ be a $k$ -connected graph with $k \geq 2$ . In this paper we first prove that: For two distinct vertices $x$ and $z$ in $G$ , it contains a path passing through its any $k - 2$ {…

cs.DS2011★ 2 cited

Deciding first order logic properties of matroids

Tomas Gavenciak, Daniel Kral, Sang-il Oum

Frick and Grohe [J. ACM 48 (2006), 1184-1206] introduced a notion of graph classes with locally bounded tree-width and established that every first order logic property can be deci…

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…