Tamás Király

activity

20152018

most citedGlobal and fixed-terminal cuts in digraphs

1 citations · 1 across the 2 of their papers we have counts for

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2018

Equitable Partitions into Matchings and Coverings in Mixed Graphs

Tamás Király, Yu Yokoi

Matchings and coverings are central topics in graph theory. The close relationship between these two has been key to many fundamental algorithmic and polyhedral results. For mixed…

math.CO2015

Blocking optimal $k$ -arborescences

Attila Bernáth, Tamás Király

Given a digraph $D = (V, A)$ and a positive integer $k$ , an arc set $F \subseteq A$ is called a \textbf{ $k$ -arborescence} if it is the disjoint union of $k$ spanning arborescences. The…

Equitable Partitions into Matchings and Coverings in Mixed Graphs

Blocking optimal k-arborescences

Blocking optimal $k$ -arborescences