1 citations · 1 across the 2 of their papers we have counts for
2 papers
math.CO2012★ 1 cited
On (2k,k)-connected graphs
Olivier Durand de Gevigney, Zoltán Szigeti
A graph G is called (2k, k)-connected if G is 2k-edge-connected and G-v is k-edge-connected for every vertex v. The study of (2k, k)-connected graphs is motivated by a conjecture o…
math.CO2012
Basic Packing of Arborescences
Olivier Durand de Gevigney, Viet-Hang Nguyen, Zoltán Szigeti
We provide the directed counterpart of a slight extension of Katoh and Tanigawa's result on rooted-tree decompositions with matroid constraints. Our result characterises digraphs h…