The \(k\)-restricted edge connectivity of balanced bipartite graphs (Q659684): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3097395 / 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: Q4856632 / 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: On the extraconnectivity of graphs / 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: 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: Sufficient conditions for graphs to be <i>λ′</i>‐optimal and super‐<i>λ′</i> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree conditions for graphs to be \(\lambda_3\)-optimal and super-\(\lambda _3\) / 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: Sufficient conditions for super \(k\)-restricted edge connectivity in graphs of diameter 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficient conditions for bipartite graphs to be super-\(k\)-restricted edge connected / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficient conditions for \(\lambda _k\)-optimality in triangle-free 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

Latest revision as of 21:22, 4 July 2024

scientific article
Language Label Description Also known as
English
The \(k\)-restricted edge connectivity of balanced bipartite graphs
scientific article

    Statements

    The \(k\)-restricted edge connectivity of balanced bipartite graphs (English)
    0 references
    0 references
    0 references
    24 January 2012
    0 references
    balanced bipartite graphs
    0 references
    edge connectivity
    0 references
    \(k\)-restricted edge connectivity
    0 references
    degree sum conditions
    0 references

    Identifiers