Minimal Connectivity

Details Minimal Connectivity Minimal Connectivity

2011-01-12

arxiv.org/abs/1101.2357v1

Mathematics

Combinatorics

IMADA-preprint-math, 33 pages

Scientific paper

A k-connected graph such that deleting any edge / deleting any vertex / contracting any edge results in a graph which is not k-connected is called minimally / critically / contraction-critically k-connected. These three classes play a prominent role in graph connectivity theory, and we give a brief introduction with a light emphasis on reduction- and construction theorems for classes of k-connected graphs.

Affiliated with

Also associated with

No associations

Rating

Minimal Connectivity does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Minimal Connectivity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Minimal Connectivity will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-265119