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

7 papers · 2 filters

math.CO2013

The Ramsey numbers of paths versus wheels: a complete solution

Binlong Li, Bo Ning

Let $G_{1}$ and $G_{2}$ be two given graphs. The Ramsey number $R (G_{1}, G_{2})$ is the least integer $r$ such that for every graph $G$ on $r$ vertices, either $G$ contains a $G_{1}$ or $\ove…

math.CO2013★ 15 cited

Colouring quadrangulations of projective spaces

Tomáš Kaiser, Matěj Stehlík

A graph embedded in a surface with all faces of size 4 is known as a quadrangulation. We extend the definition of quadrangulation to higher dimensions, and prove that any graph G w…

math.CO2013★ 4 cited

Flips in combinatorial pointed pseudo-triangulations with face degree at most four

Oswin Aichholzer, Thomas Hackl, David Orden +3

In this paper we consider the flip operation for combinatorial pointed pseudo-triangulations where faces have size 3 or 4, so-called combinatorial 4-PPTs. We show that every combin…

math.CO2013★ 42 cited

Star edge coloring of some classes of graphs

Ľudmila Bezegová, Borut Lužar, Martina Mockovčiaková +2

\textit{A star edge coloring} of a graph is a proper edge coloring without bichromatic paths and cycles of length four. In this paper we establish tight upper bounds for trees and…

math.CO2013★ 8 cited

l-facial edge colorings of graphs

Borut Lužar, Martina Mockovčiaková, Roman Soták +2

An l-facial edge coloring of a plane graph is a coloring of the edges such that any two edges at distance at most l on a boundary walk of some face receive distinct colors. It is c…

math.CO2013

The Packing Coloring of Distance Graphs $D (k, t)$

Jan Ekstein, Přemysl Holub, Olivier Togni

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

math.CO2013★ 48 cited

Replication in critical graphs and the persistence of monomial ideals

Tomáš Kaiser, Matěj Stehlík, Riste Škrekovski

Motivated by questions about square-free monomial ideals in polynomial rings, in 2010 Francisco et al. conjectured that for every positive integer k and every k-critical (i.e., cri…