Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal (Q864174): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2006.06.028 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2054706367 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graphs with equal edge connectivity and minimum degree / 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: A Graph-Theoretic Approach to a Communications Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4355069 / 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 graphs with equal edge-connectivity and minimum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Isoperimetric Connectivity in Vertex-Transitive Graphs / 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: 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: Q5466060 / 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
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:07, 25 June 2024

scientific article
Language Label Description Also known as
English
Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal
scientific article

    Statements

    Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal (English)
    0 references
    0 references
    0 references
    13 February 2007
    0 references
    0 references
    restricted-edge-connectivity
    0 references
    isoperimetric-edge-connectivity
    0 references
    0 references