activity
20062024
most citedStrong edge colorings of graphs and the covers of Kneser graphs

12 citations · 26 across the 13 of their papers we have counts for

collaborators
Showing 2015Show all

1 paper · 1 filter

math.CO2015

Simple greedy 2-approximation algorithm for the maximum genus of a graph

Michal Kotrbcik, Martin Skoviera

The maximum genus of a graph G is the largest genus of an orientable surface into which G has a cellular embedding. Combinatorially, it coincides with the maximum number o…