On extremal graphs with exactly one Steiner tree connecting any $k$ vertices
From MaRDI portal
Publication:5374223
zbMath1383.05170arXiv1301.4623MaRDI QIDQ5374223
Publication date: 10 April 2018
Full work available at URL: https://arxiv.org/abs/1301.4623
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On extremal graphs with internally disjoint Steiner trees
- On k-rails in graphs
- On extremal graphs with at most \(\ell\) internally disjoint Steiner trees connecting any \(n-1\) vertices
- Sharp bounds for the generalized connectivity \(\kappa _{3}(G)\)
- Note on the hardness of generalized connectivity
- Note on the spanning-tree packing number of lexicographic product graphs
- On graphs with at most four line-disjoint paths connecting any two vertices
- Ein Extremalproblem des Zusammenhangs von Graphen
- Grad und lokaler Zusammenhang in endlichen Graphen
- On a conjecture of Bollobas and Erdős
- On the generalized (edge-)connectivity of graphs
- On the Problem of Decomposing a Graph into n Connected Factors
- Edge-Disjoint Spanning Trees of Finite Graphs
- The generalized 3-connectivity of Lexicographic product graphs
- Graphs with 6-Ways