|
|
|
|
References
|
|
| |
| 1. |
S. MacLane, “A structural characterization of planar combinatorial graphs”, Duke Math. J., 3:3 (1937), 460–472    |
| 2. |
G. Chartrand, A. Kaugars, D. R. Lick, “Critically $n$-connected graphs”, Proc. Amer. Math. Soc., 32 (1972), 63–68 |
| 3. |
Y. O. Hamidoune, “On critically $h$-connected graphs”, Discr. Math., 32 (1980), 257–262  |
| 4. |
W. T. Tutte, Connectivity in graphs, Univ. Toronto Press, Toronto, 1966 |
| 5. |
W. T. Tutte, “A theory of $3$-connected graphs”, Indag. Math., 23 (1961), 441–455 |
| 6. |
W. Hohberg, “The decomposition of graphs into $k$-connected components”, Discr. Math., 109 (1992), 133–145 |
| 7. |
F. Kharari, Teoriya grafov, Mir, M., 1973 |
| 8. |
O. Ore, Teoriya grafov, Nauka, M., 1968 |
| 9. |
D. V. Karpov, A. V. Pastor, “O strukture $k$-svyaznogo grafa”, Zap. nauchn. semin. POMI, 266, 2000, 76–106  |
| 10. |
D. V. Karpov, “Bloki v $k$-svyaznykh grafakh”, Zap. nauchn. semin. POMI, 293, 2002, 59–93 |
| 11. |
D. V. Karpov, “Razdelyayuschie mnozhestva v $k$-svyaznom grafe”, Zap. nauchn. semin. POMI, 340, 2006, 33–60 |
