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

5 papers · 2 filters

math.CO2012

Hamiltonian Cycles in the Square of a Graph

Jan Ekstein

We show that under certain conditions the square of the graph obtained by identifying a vertex in two graphs with hamiltonian square is also hamiltonian. Using this result, we prov…

math.CO2012★ 12 cited

The distance-t chromatic index of graphs

Tomáš Kaiser, Ross J. Kang

We consider two graph colouring problems in which edges at distance at most are given distinct colours, for some fixed positive integer . We obtain two upper bounds for the…

math.CO2012

Multiple Petersen subdivisions in permutation graphs

Tomáš Kaiser, Jean-Sébastien Sereni, Zelealem Yilma

A permutation graph is a cubic graph admitting a 1-factor M whose complement consists of two chordless cycles. Extending results of Ellingham and of Goldwasser and Zhang, we prove…

math.CO2012★ 5 cited

On large bipartite graphs of diameter 3

Ramiro Feria-Puron, Mirka Miller, Guillermo Pineda-Villavicencio

We consider the bipartite version of the {\it degree/diameter problem}, namely, given natural numbers and , find the maximum number of vertices in a bipa…

math.CO2012★ 2 cited

The fractional chromatic number of triangle-free subcubic graphs

David Ferguson, Tomáš Kaiser, Daniel Král'

Heckman and Thomas conjectured that the fractional chromatic number of any triangle-free subcubic graph is at most 14/5. Improving on estimates of Hatami and Zhu and of Lu and Peng…