2 citations · 5 across the 10 of their papers we have counts for
3 papers · 1 filter
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…
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…
Packing of Rigid Spanning Subgraphs and Spanning Trees
Joseph Cheriyan, Olivier Durand de Gevigney, Zoltán Szigeti
We prove that every (6k + 2l, 2k)-connected simple graph contains k rigid and l connected edge-disjoint spanning subgraphs. This implies a theorem of Jackson and Jordán [4] and a t…