Article ID Journal Published Year Pages File Type
10524045 Operations Research Letters 2005 4 Pages PDF
Abstract
A graph G=(V,E) is called l-mixed p-connected if G-S-L is connected for all pairs S,L with S⊆V, L⊆E, and l|S|+|L|
Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
Sparse certificates and removable cycles in l-mixed p-connected graphs
Authors
, ,