Maximally edge-connected hypergraphs (Q501024): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Augmenting hypergraphs by edges of size two / 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: Edge-augmentation of hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse degree and edge-connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871755 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4284618 / 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: Q4079637 / rank
 
Normal rank
Property / cites work
 
Property / cites work: HYPERGRAPHS / rank
 
Normal rank

Revision as of 20:44, 10 July 2024

scientific article
Language Label Description Also known as
English
Maximally edge-connected hypergraphs
scientific article

    Statements

    Maximally edge-connected hypergraphs (English)
    0 references
    0 references
    0 references
    8 October 2015
    0 references
    hypergraph
    0 references
    edge connectivity
    0 references
    connectivity
    0 references
    maximally edge-connected graph
    0 references

    Identifiers