On extremal graphs with at most \(\ell\) internally disjoint Steiner trees connecting any \(n-1\) vertices (Q897279): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Packing of Steiner trees and \(S\)-connectors in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2911581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The average connectivity of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3852212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5520565 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles and semi-topological configurations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow trees in graphs and generalized connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3987052 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity and edge-disjoint spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pendant tree-connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4386304 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471308 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-disjoint trees containing some given vertices in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge disjoint Steiner trees in graphs without large bridges / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximate max-Steiner-tree-packing min-Steiner-cut theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a conjecture of Bollobas and Erdős / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graphs with at most four line-disjoint paths connecting any two vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with 6-Ways / rank
 
Normal rank
Property / cites work
 
Property / cites work: On extremal graphs with internally disjoint Steiner trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with large generalized 3-connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The generalized 3-connectivity of Cartesian product graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The generalized connectivity of complete equipartition 3-partite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on the hardness of generalized connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp bounds for the generalized connectivity \(\kappa _{3}(G)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The generalized 3-connectivity of Lexicographic product graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the generalized (edge-)connectivity of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ein Extremalproblem des Zusammenhangs von Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grad und lokaler Zusammenhang in endlichen Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über die Maximalzahl kantendisjunkter A-Wege / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über die Maximalzahl kreuzungsfreier H-Wege / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-Disjoint Spanning Trees of Finite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393242 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the \(\ell\)-connectivity of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3803148 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On k-rails in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Problem of Decomposing a Graph into <i>n</i> Connected Factors / rank
 
Normal rank

Latest revision as of 05:50, 11 July 2024

scientific article
Language Label Description Also known as
English
On extremal graphs with at most \(\ell\) internally disjoint Steiner trees connecting any \(n-1\) vertices
scientific article

    Statements

    On extremal graphs with at most \(\ell\) internally disjoint Steiner trees connecting any \(n-1\) vertices (English)
    0 references
    0 references
    0 references
    17 December 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    (edge-)connectivity
    0 references
    Steiner tree
    0 references
    internally (edge-)disjoint trees
    0 references
    packing
    0 references
    generalized local (edge-)connectivity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references