Ends and Vertices of Small Degree in Infinite Minimally k-(Edge)-Connected Graphs

Bounds on the minimum degree and on the number of vertices attaining it have been much studied for finite edge-/vertex-minimally kconnected/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.

• Type: Journal
• Year: 2010
• Where: SIAMDM
• Authors: Maya Stein
• Keywords: Infinite, Minimum Degree, SIAMDM 2010, Small Degree