|
[1]
|
Bang-Jensen, J. and Gutin, G.Z. (2009) Digraphs: Theory, Algorithms and Applications. 2nd Edition, Springer, London. [Google Scholar] [CrossRef]
|
|
[2]
|
Bondy, J.A. and Murty, U.S.R. (2008) Graph Theory, Springer, Ber-lin.
|
|
[3]
|
Hager, M. (1985) Pendant Tree-Connectivity. Journal of Combinatorial Theory, Series B, 38, 179-189. [Google Scholar] [CrossRef]
|
|
[4]
|
Li, S., Li, W. and Li, X. (2012) The Generalized Connectivity of Complete Bipartite Graphs, Ars Combinatoria, 104, 65-79.
|
|
[5]
|
Li, X. and Mao, Y. (2016) Generalized Connectivity of Graphs, Springer, Switzerland. [Google Scholar] [CrossRef]
|
|
[6]
|
Sun, Y. and Gutin, G. (2021) Strong Subgraph Connectivity of Digraphs. Graphs and Combinatorics, 37, 951-970. [Google Scholar] [CrossRef]
|
|
[7]
|
Sun, Y.F. and Gutin, G., Yeo, A. and Zhang, X.Y. (2019) Strong Subgraph k-Connectivity. Journal of Graph Theory, 92, 5-18. [Google Scholar] [CrossRef]
|
|
[8]
|
Sun, Y.F. and Gutin, G. (2021) Strong Subgraph Connectivity of Digraphs: A Survey. Journal of Interconnection Networks, 21, Article No. 2142004. [Google Scholar] [CrossRef]
|
|
[9]
|
Ng, L.L. (1997) Hamiltonian Decomposition of Complete Regular Multipartite Digraphs. Discrete Mathematics, 177, 279-285. [Google Scholar] [CrossRef]
|
|
[10]
|
Tillson, T.W. (1980) A Hamiltonian Decomposition of , . Journal of Combinatorial Theory, Series B, 29, 68-74. [Google Scholar] [CrossRef]
|
|
[11]
|
Sun, Y., Gutin, G. and Zhang, X. (2021) Packing Strong Subgraph in Di-graphs.
|