2 citations · 2 across the 3 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2015★ 2 cited
Equimatchable factor-critical graphs and independence number 2
Eduard Eiben, Michal Kotrbcik
A graph is equimatchable if each of its matchings is a subset of a maximum matching. It is known that any 2-connected equimatchable graph is either bipartite, or factor-critical, a…
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…