Pages that link to "Item:Q1043946"
From MaRDI portal
The following pages link to Canonical and monophonic convexities in hypergraphs (Q1043946):
Displaying 8 items.
- Equivalence between hypergraph convexities (Q410668) (← links)
- On the geodeticity of the contour of a graph (Q479045) (← links)
- Polynomial time algorithm for computing a minimum geodetic set in outerplanar graphs (Q1786594) (← links)
- Computing simple-path convex hulls in hypergraphs (Q1944079) (← links)
- Decomposable convexities in graphs and hypergraphs (Q1952718) (← links)
- On the complexity of finding chordless paths in bipartite graphs and some interval operators in graphs and hypergraphs (Q2268880) (← links)
- Decomposability of abstract and path-induced convexities in hypergraphs (Q2516676) (← links)
- (Q3057242) (← links)