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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1002/jgt.23035 / rank
Normal rank
 
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
Property / DOI
 
Property / DOI: 10.1002/JGT.23035 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:51, 30 December 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