图的分支点连通度和分支边连通度综述(英文)
supported by National Natural Science Foundation of Xingjiang,China “Fault-tolerance of graphs and networks”(2020D04046); National Natural Science Foundation of the People's Republic of China “On the sizes of vertex(edge)-k-maximal r-uniform hypergraphs”(11261086),“On the disjoint path covers in graphs and related problems”(12261085)
/
| 〈 |
|
〉 |