Characterizing the forbidden pairs for graphs to be super-edge-connected

Let [Formula: see text] be a set of given connected graphs. A graph G is said to be [Formula: see text]-free if G contains no H as an induced subgraph for any [Formula: see text]. The graph G is super-edge-connected if each minimum edge-cut isolates a vertex in G. In this paper, except for some special graphs, we characterize all forbidden subgraph sets [Formula: see text] such that every [Formula: see text]-free graph is super-edge-connected for [Formula: see text] and 2.

Abstract licence: CC BY-NC

9 more references, whose wording the paper’s licence keeps private.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.