The Tree of Cuts and Minimal k-Connected Graphs
- 29 Downloads
A cut of a k-connected graph G is a k-element cutset of it, which contains at least one edge. The tree of cuts of a set
In the second part of the paper, the tree of cuts is used to study minimal k-connected graphs for k ≤ 5. Bibliography: 11 titles.
KeywordsBipartite Graph Common Edge Distinct Edge Mutual Disposition Minimal Part
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- 5.W. Mader, “On vertices of degree n in minimally n-connected graphs and digraphs,” in: Combinatorics, Paul Erd¨os is Eighty, Vol. 2, Budapest (1996), pp. 423–449.Google Scholar
- 7.F. Harary, Graph Theory, Addison-Wesley (1969).Google Scholar
- 8.D. V. Karpov and A. V. Pastor, “The structure of a decomposition of a triconnected graph,” Zap. Nauchn. Semin. POMI, 391, 90–148 (2011).Google Scholar
- 10.D. V. Karpov, “The tree of decomposition of a biconnected graph,” Zap. Nauchn. Semin. POMI, 417, 86–105 (2013).Google Scholar
- 11.D. V. Karpov, “Minimal k-connected graphs with minimal number of vertices of degree k,” Zap. Nauchn. Semin. POMI, 427, 41–65 (2014).Google Scholar
© Springer Science+Business Media New York 2016