Sufficient conditions for a graph to be super restricted edge-connected

Authors:
Shiying Wang;Shangwei Lin
Affiliations:
School of Mathematical Sciences, Shanxi University, Taiyuan 030006, People's Republic of China;School of Mathematical Sciences, Shanxi University, Taiyuan 030006, People's Republic of China
Venue:
Networks
Year:
2008

Citing 0
Cited 5

Super p-restricted edge connectivity of line graphs

Information Sciences: an International Journal
Super-connected but not super edge-connected graphs

Information Processing Letters
Edge fault tolerance of super edge connectivity for three families of interconnection networks

Information Sciences: an International Journal
Super restricted edge connectivity of regular edge-transitive graphs

Discrete Applied Mathematics
Note: Super restricted edge-connectivity of graphs with diameter 2

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

The resource constrained elementary shortest path problem (RCESPP) arises as a pricing subproblem in branch-and-price algorithms for vehicle-routing problems with additional constraints. We address the optimization of the RCESPP and we present and compare ...