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

4 papers · 2 filters

math.CO2017★ 5 cited

3-coloring triangle-free planar graphs with a precolored 9-cycle

Ilkyoo Choi, Jan Ekstein, Přemysl Holub +1

Given a triangle-free planar graph G and a 9-cycle C in G, we characterize situations where a 3-coloring of C does not extend to a proper 3-coloring of G. This extends previous res…

math.CO2017★ 9 cited

Note on list star edge-coloring of subcubic graphs

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

{\emph A star edge-coloring} of a graph is a proper edge-coloring without bichromatic paths and cycles of length four. In this paper, we consider the list version of this coloring…

math.CO2017

Long paths and toughness of k-trees and chordal planar graphs

Adam Kabela

We show that every $k$ -tree of toughness greater than $\frac{k}{3}$ is Hamilton-connected for $k \geq 3$ . (In particular, chordal planar graphs of toughness greater than $1$ are Ha…

math.CO2017★ 1 cited

3-Flows with Large Support

Matt DeVos, Jessica McDonald, Irene Pivotto +2

We prove that every 3-edge-connected graph $G$ has a 3-flow $ϕ$ with the property that $∣ s u pp (ϕ) ∣ \geq \frac{5}{6} ∣ E (G) ∣$ . The graph $K_{4}$ demonstrates that this $\frac{5}…