Pages that link to "Item:Q897279"

The following pages link to On extremal graphs with at most \(\ell\) internally disjoint Steiner trees connecting any \(n-1\) vertices (Q897279):

Displayed 12 items.

• The \((k,\ell)\)-rainbow index of random graphs (Q263013) ‎ (← links)
• Sharp upper bounds for generalized edge-connectivity of product graphs (Q339466) ‎ (← links)
• Graphs with large generalized (edge-)connectivity (Q339485) ‎ (← links)
• Tree connectivities of Cayley graphs on abelian groups with small degrees (Q503543) ‎ (← links)
• A solution to a conjecture on the generalized connectivity of graphs (Q512887) ‎ (← links)
• On the difference of two generalized connectivities of a graph (Q512888) ‎ (← links)
• On two generalized connectivities of graphs (Q1692646) ‎ (← links)
• A result on the 3-generalized connectivity of a graph and its line graph (Q1714044) ‎ (← links)
• Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs (Q2341720) ‎ (← links)
• On the maximum and minimum sizes of a graph with given \(k\)-connectivity (Q2364084) ‎ (← links)
• On extremal graphs with exactly one Steiner tree connecting any $k$ vertices (Q5374223) ‎ (← links)
• Constructing Internally Disjoint Pendant Steiner Trees in Cartesian Product Networks (Q5374226) ‎ (← links)