Whitney's connectivity inequalities for directed hypergraphs
From MaRDI portal
Publication:5045242
DOI10.26493/2590-9770.1380.1c9zbMath1497.05193OpenAlexW3133921777MaRDI QIDQ5045242
Peter F. Stadler, Anahy Santiago Arguello
Publication date: 4 November 2022
Published in: The Art of Discrete and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.26493/2590-9770.1380.1c9
connectivity indicesstrong connectednessdirected hypergraphtotal degreestrong and weak vertex eliminationunilateral connectedness
Related Items (1)
Cites Work
- Directed hypergraphs: introduction and fundamental algorithms -- a survey
- On the complexity of strongly connected components in directed hypergraphs
- On finding hypercycles in chemical reaction networks
- Hypermaps versus bipartite maps
- Directed hypergraphs and applications
- Implicit Enumeration of Hyperpaths in a Logit Model for Transit Networks
- Congruent Graphs and the Connectivity of Graphs
- Connectivity in Hypergraphs
- Connection and separation in hypergraphs
This page was built for publication: Whitney's connectivity inequalities for directed hypergraphs