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 2020 · math.COShow all

4 papers · 2 filters

math.CO2020

Hamiltonian properties in generalized lexicographic products

Jan Ekstein, Jakub Teska

The lexicographic product $G [H]$ of two graphs $G$ and $H$ is obtained from $G$ by replacing each vertex with a copy of $H$ and adding all edges between any pair of copies correspo…

math.CO2020★ 4 cited

Edge-critical subgraphs of Schrijver graphs II: The general case

Tomáš Kaiser, Matěj Stehlík

We give a simple combinatorial description of an $(n - 2 k + 2)$ -chromatic edge-critical subgraph of the Schrijver graph $SG (n, k)$ , itself an induced vertex-critical subgraph o…

math.CO2020★ 1 cited

Star Edge-Coloring of Square Grids

Přemysl Holub, Borut Lužar, Erika Mihaliková +2

A star edge-coloring of a graph $G$ is a proper edge-coloring without bichromatic paths or cycles of length four. The smallest integer $k$ such that $G$ admits a star edge-coloring…

math.CO2020

Trestles in the squares of graphs

Adam Kabela, Jakub Teska

We show that the square of every connected $S (K_{1, 4})$ -free graph satisfying a matching condition has a $2$ -connected spanning subgraph of maximum degree at most~ $3$ . Furthermore,…