Sufficient conditions for bipartite graphs to be super-\(k\)-restricted edge connected (Q1043644): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.disc.2008.07.022 / rank
Normal rank
 
Property / author
 
Property / author: Shi-ying Wang / rank
Normal rank
 
Property / author
 
Property / author: Shi-ying Wang / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2008.07.022 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2047758589 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Superconnectivity of bipartite digraphs and graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficient conditions for λ′‐optimality in graphs with girth <i>g</i> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synthesis of reliable networks - a survey / rank
 
Normal rank
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: 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: 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: Asymptotic Formulas for the Probability of <i>k</i>-Connectedness of Random Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Super edge connectivity properties of connected edge symmetric graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimally super-edge-connected transitive 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: Conditional edge connectivity properties, reliability comparisons and transitivity of 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 / DOI
 
Property / DOI: 10.1016/J.DISC.2008.07.022 / rank
 
Normal rank

Latest revision as of 15:00, 10 December 2024

scientific article
Language Label Description Also known as
English
Sufficient conditions for bipartite graphs to be super-\(k\)-restricted edge connected
scientific article

    Statements

    Sufficient conditions for bipartite graphs to be super-\(k\)-restricted edge connected (English)
    0 references
    0 references
    0 references
    0 references
    9 December 2009
    0 references
    restricted edge connectivity
    0 references
    \(k\)-restricted edge connectivity
    0 references
    super-\(\lambda {^{\prime}}\) graph
    0 references
    \(\lambda _k\)-optimal graph
    0 references
    super-\(\lambda _k\) graph
    0 references

    Identifiers