A solution to a conjecture on the generalized connectivity of graphs (Q512887): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q122879028 / 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: The Steiner tree packing problem in VLSI design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing Steiner trees: A cutting plane algorithm and computational results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471308 / 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: The generalized 3-connectivity of Lexicographic product graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On extremal graphs with at most \(\ell\) internally disjoint Steiner trees connecting any \(n-1\) vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimal size of a graph with given generalized 3-edge-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 Cartesian product graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The generalized connectivity of complete bipartite 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: On the generalized (edge-)connectivity of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3012590 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4257150 / rank
 
Normal rank

Latest revision as of 12:52, 13 July 2024

scientific article
Language Label Description Also known as
English
A solution to a conjecture on the generalized connectivity of graphs
scientific article

    Statements

    A solution to a conjecture on the generalized connectivity of graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    3 March 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    generalized connectivity
    0 references
    generalized edge connectivity
    0 references
    complexity
    0 references
    polynomial-time algorithm
    0 references
    NP-completeness
    0 references
    0 references
    0 references