A New Perspective on Vertex Connectivity

@inproceedings{CensorHillel2014ANP,
  title={A New Perspective on Vertex Connectivity},
  author={Keren Censor-Hillel and Mohsen Ghaffari and Fabian Kuhn},
  booktitle={SODA},
  year={2014}
}
Edge connectivity and vertex connectivity are two fundamental concepts in graph theory. Although by now there is a good understanding of the structure of graphs based on their edge connectivity, our knowledge in the case of vertex connectivity is much more limited. An essential tool in capturing edge connectivity are the classical results of Tutte and Nash-Williams from 1961 which show that a λ-edgeconnected graph contains d(λ− 1)/2e edge-disjoint spanning trees. We argue that connected… CONTINUE READING
Highly Cited
This paper has 30 citations. REVIEW CITATIONS

References

Publications referenced by this paper.
Showing 1-10 of 38 references

Edge-disjoint spanning tree s of finite graphs.J. of the London Math. Society

  • C.S.J.A. Nash-Williams
  • 1961
Highly Influential
7 Excerpts

On the problem of decomposing a graph into connected factors

  • W. T. Tutte
  • J. of the London Math. Society , 36:221–230,
  • 1961
Highly Influential
7 Excerpts

Distributed connected dominating set packing

  • K. Censor-Hillel, M. Ghaffari, F. Kuhn
  • Unpublished Manuscript,
  • 2013
1 Excerpt

Similar Papers

Loading similar papers…