Ends and vertices of small degree in infinite minimally k-(edge)-connected graphs

Details Ends and vertices of small degree in infinite minimally k-(edge)-connected graphs Ends and vertices of small degree in infinite minimally k-(edge)-connected graphs

2011-02-03

arxiv.org/abs/1102.0693v1

Mathematics

Combinatorics

15 pages

Scientific paper

Bounds on the minimum degree and on the number of vertices at- taining it
have been much studied for finite edge-/vertex-minimally k-
connected/k-edge-connected graphs. We give an overview of the results known for
finite graphs, and show that most of these carry over to infinite graphs if we
consider ends of small degree as well as vertices.

Affiliated with

Also associated with

No associations

Rating

Ends and vertices of small degree in infinite minimally k-(edge)-connected graphs 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 Ends and vertices of small degree in infinite minimally k-(edge)-connected graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Ends and vertices of small degree in infinite minimally k-(edge)-connected graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-427871