Graphs with large generalized (edge-)connectivity (Q339485): Difference between revisions

@@ Property / arXiv ID @@
+.1089
@@ Property / arXiv ID: 1305.1089 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2911581
@@ Property / cites work: Q2911581 / rank @@
+Normal rank
@@ Property / cites work @@
+A Generalization of Line Connectivity and Optimally Invulnerable Graphs
+Normal rank
@@ Property / cites work @@
+Rainbow trees in graphs and generalized connectivity
+Normal rank
@@ Property / cites work @@
+Q3987052
@@ Property / cites work: Q3987052 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3898529
@@ Property / cites work: Q3898529 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3953800
@@ Property / cites work: Q3953800 / rank @@
+Normal rank
@@ Property / cites work @@
+Separation of graphs into three components by the removal of edges
+Normal rank
@@ Property / cites work @@
+The Steiner tree packing problem in VLSI design
@@ Property / cites work: The Steiner tree packing problem in VLSI design / rank @@
+Normal rank
@@ Property / cites work @@
+Packing Steiner trees: A cutting plane algorithm and computational results
+Normal rank
@@ Property / cites work @@
+Pendant tree-connectivity
@@ Property / cites work: Pendant tree-connectivity / rank @@
+Normal rank
@@ Property / cites work @@
+Path-connectivity in graphs
@@ Property / cites work: Path-connectivity in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4386304
@@ Property / cites work: Q4386304 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4471308
@@ Property / cites work: Q4471308 / rank @@
+Normal rank
@@ Property / cites work @@
+Edge-disjoint trees containing some given vertices in a graph
+Normal rank
@@ Property / cites work @@
+Edge disjoint Steiner trees in graphs without large bridges
+Normal rank
@@ Property / cites work @@
+Über die Maximalzahl kantendisjunkter A-Wege
@@ Property / cites work: Über die Maximalzahl kantendisjunkter A-Wege / rank @@
+Normal rank
@@ Property / cites work @@
+Über die Maximalzahl kreuzungsfreier H-Wege
@@ Property / cites work: Über die Maximalzahl kreuzungsfreier H-Wege / rank @@
+Normal rank
@@ Property / cites work @@
+On extremal graphs with internally disjoint Steiner trees
+Normal rank
@@ Property / cites work @@
+Graphs with large generalized 3-connectivity
@@ Property / cites work: Graphs with large generalized 3-connectivity / rank @@
+Normal rank
@@ Property / cites work @@
+Note on the spanning-tree packing number of lexicographic product graphs
+Normal rank
@@ Property / cites work @@
+The generalized 3-connectivity of Cartesian product graphs
+Normal rank
@@ Property / cites work @@
+The generalized connectivity of complete equipartition 3-partite graphs
+Normal rank
@@ Property / cites work @@
+Note on the hardness of generalized connectivity
@@ Property / cites work: Note on the hardness of generalized connectivity / rank @@
+Normal rank
@@ Property / cites work @@
+Sharp bounds for the generalized connectivity \(\kappa _{3}(G)\)
+Normal rank
@@ Property / cites work @@
+Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs
+Normal rank
@@ Property / cites work @@
+On extremal graphs with at most \(\ell\) internally disjoint Steiner trees connecting any \(n-1\) vertices
+Normal rank
@@ Property / cites work @@
+The generalized 3-connectivity of Lexicographic product graphs
+Normal rank
@@ Property / cites work @@
+The minimal size of a graph with given generalized 3-edge-connectivity
+Normal rank
@@ Property / cites work @@
+On the generalized (edge-)connectivity of graphs
@@ Property / cites work: On the generalized (edge-)connectivity of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Edge-Disjoint Spanning Trees of Finite Graphs
@@ Property / cites work: Edge-Disjoint Spanning Trees of Finite Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4393242
@@ Property / cites work: Q4393242 / rank @@
+Normal rank
@@ Property / cites work @@
+On the \(\ell\)-connectivity of a graph
@@ Property / cites work: On the \(\ell\)-connectivity of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Q3803148
@@ Property / cites work: Q3803148 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3012590
@@ Property / cites work: Q3012590 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4257150
@@ Property / cites work: Q4257150 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Problem of Decomposing a Graph into <i>n</i>  Connected Factors
+Normal rank
@@ Property / cites work @@
+Packing of Steiner trees and \(S\)-connectors in graphs
+Normal rank