Degree conditions for graphs to be \(\lambda_3\)-optimal and super-\(\lambda _3\) (Q1025958): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Extraconnectivity of graphs with large minimum degree and girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-cuts leaving components of order at least three / rank
 
Normal rank
Property / cites work
 
Property / cites work: On computing a conditional edge-connectivity of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extraconnectivity of graphs with large girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the extraconnectivity of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cuts leaving components of given minimum order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficient conditions for \(\lambda'\)-optimality in graphs of diameter 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficient conditions for graphs to be ??-optimal, super-edge-connected, and maximally edge-connected / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximally edge-connected and vertex-connected graphs and digraphs: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Results on the edge-connectivity of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a kind of restricted edge connectivity of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge cuts leaving components of order at least \(m\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bound on 4-restricted edge connectivity of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5464303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficient conditions for graphs to be <i>λ′</i>‐optimal and super‐<i>λ′</i> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5781249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditional edge connectivity properties, reliability comparisons and transitivity of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization problems of the third edge-connectivity of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2704926 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bound on the third edge-connectivity of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On optimally-\(\lambda^{(3)}\) transitive graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof of an inequality concerning \(k\)-restricted edge connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficient conditions for restricted-edge-connectivity to be optimal / rank
 
Normal rank

Latest revision as of 17:29, 1 July 2024

scientific article
Language Label Description Also known as
English
Degree conditions for graphs to be \(\lambda_3\)-optimal and super-\(\lambda _3\)
scientific article

    Statements

    Degree conditions for graphs to be \(\lambda_3\)-optimal and super-\(\lambda _3\) (English)
    0 references
    0 references
    0 references
    23 June 2009
    0 references
    0 references
    3-restricted edge connectivity
    0 references
    optimally 3-restricted edge connected
    0 references
    super-3-restricted edge connected
    0 references
    0 references
    0 references
    0 references
    0 references