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

3 papers · 2 filters

math.CO2015

Jordan-like characterization of automorphism groups of planar graphs

Pavel Klavík, Roman Nedela, Peter Zeman

We investigate automorphism groups of planar graphs. The main result is a complete recursive description of all abstract groups that can be realized as automorphism groups of plana…

math.CO2015★ 3 cited

Planar graphs have two-coloring number at most 8

Zdeněk Dvořák, Adam Kabela, Tomáš Kaiser

We prove that the two-colouring number of any planar graph is at most 8. This resolves a question of Kierstead et al. [SIAM J. Discrete Math.~23 (2009), 1548--1560]. The result is…

math.CO2015★ 3 cited

First order limits of sparse graphs: Plane trees and path-width

Jakub Gajarsky, Petr Hlineny, Tomas Kaiser +5

Nesetril and Ossona de Mendez introduced the notion of first order convergence as an attempt to unify the notions of convergence for sparse and dense graphs. It is known that there…