Name
Abstract | ||
|---|---|---|
Bounds on the minimum degree and on the number of vertices attaining 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. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1137/100783686 | SIAM Journal on Discrete Mathematics |
Keywords | Field | DocType |
Small Degree,finite edge,edge-connected graph,Connected Graphs,Infinite Minimally,finite graph,small degree,minimum degree | Discrete mathematics,Combinatorics,Indifference graph,Vertex (geometry),Clique-sum,Chordal graph,Independent set,Connectivity,Trapezoid graph,Mathematics,Metric dimension | Journal |
Volume | Issue | ISSN |
24 | 4 | 0895-4801 |
Citations | PageRank | References |
2 | 0.38 | 7 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| maya stein | 1 | 81 | 15.65 |