Counterexamples to theorems of Menger type for the diameter
暂无分享，去创建一个
[1] Alon Itai,et al. The complexity of finding maximum disjoint paths with length constraints , 1982, Networks.
[2] Geoffrey Exoo,et al. A counterexample to a conjecture on paths of bounded length , 1982, J. Graph Theory.
[3] Frank Harary,et al. Graphs as models of communication network vulnerability: Connectivity and persistence , 1981, Networks.
[4] L. Lovász,et al. Mengerian theorems for paths of bounded length , 1978 .
[5] Izhak Rubin,et al. On diameter stability of graphs , 1978 .
[6] Roger C. Entringer,et al. Geodetic connectivity of graphs , 1977 .