2023/05/02 by Hoppenot, Pierre, Szigeti, Zoltán
#Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics
paper · doi:10.48550/arxiv.2305.01444
We show that if the arc-connectivity of a directed graph D is at most \lfloor(k+1)/(2)\rfloor and the reorientation of an arc set F in D results in a k-arc-connected directed graph then we can reorient one arc of F without decreasing the arc-connectivity of D. This improves a result of Fukuda, Prodon, Sakuma and one of Ito et al. for k∈\2,3\.