Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs (Q2341720): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1965562121 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1212.6692 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4014618 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5615290 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of Nordhaus-Gaddum type relations / 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: THE MAXIMUM CONNECTIVITY OF A GRAPH / 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: Note on the hardness of generalized connectivity / 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 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: Sharp bounds for the generalized connectivity \(\kappa _{3}(G)\) / 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: The generalized 3-connectivity of Lexicographic product 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: On the generalized (edge-)connectivity of graphs / 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: On the spanning tree packing number of a graph: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4257150 / 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
Property / cites work
 
Property / cites work: Packing of Steiner trees and \(S\)-connectors in graphs / rank
 
Normal rank

Latest revision as of 00:06, 10 July 2024

scientific article
Language Label Description Also known as
English
Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs
scientific article

    Statements

    Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs (English)
    0 references
    0 references
    0 references
    28 April 2015
    0 references
    edge-connectivity
    0 references
    Steiner tree
    0 references
    edge-disjoint Steiner trees
    0 references
    generalized edge-connectivity
    0 references
    packing
    0 references
    complementary graph
    0 references
    Nordhaus-Gaddum-type result
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references