The edge‐connectivity of vertex‐transitive hypergraphs (Q6143385): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Connection and separation in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximally edge-connected hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity in Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2716030 / 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: Edge-connectivity of permutation hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimale \(n\)-fach kantenzusammenhängende Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficient conditions for maximally edge-connected hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficient conditions for hypergraphs to be maximally edge-connected / rank
 
Normal rank

Revision as of 20:16, 23 August 2024

scientific article; zbMATH DE number 7793913
Language Label Description Also known as
English
The edge‐connectivity of vertex‐transitive hypergraphs
scientific article; zbMATH DE number 7793913

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references