Edge-connection of graphs, digraphs, and hypergraphs

MaRDI QIDQ5477813zbMATH OpenFDO

Authors

Publication date 29 June 2006

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40) Hypergraphs (05C65)

Recommendations

• scientific article; zbMATH DE number 5535213
• Edge-connectivity augmentations of~graphs~and~hypergraphs
• On the orientation of graphs and hypergraphs
• Successive edge-connectivity augmentation problems
• Sufficient conditions for maximally edge-connected hypergraphs

Cited in

(14)

• On the orientation of graphs and hypergraphs
• On the sizes of \(k\)-edge-maximal \(r\)-uniform hypergraphs
• Approximating node-connectivity augmentation problems
• A Survey on Covering Supermodular Functions
• Graph orientations with set connectivity requirements
• Projections, entropy and sumsets
• scientific article; zbMATH DE number 942492 (Why is no real title available?)
• scientific article; zbMATH DE number 2097434 (Why is no real title available?)
• Whitney's connectivity inequalities for directed hypergraphs
• Connectivity in semigraphs
• Generalization of pinching operation to binary matroids
• The constructive characterization of (k,l)-edge-connected digraphs
• On the sizes of bi-k-edge-maximal r-uniform hypergraphs
• Local edge-connectivity augmentation in hypergraphs is NP-complete

This page was built for publication: Edge-connection of graphs, digraphs, and hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5477813)