Pages that link to "Item:Q1410690"
From MaRDI portal
The following pages link to On the orientation of graphs and hypergraphs (Q1410690):
Displaying 18 items.
- On vertex independence number of uniform hypergraphs (Q399512) (← links)
- Resource-sharing systems and hypergraph colorings (Q411210) (← links)
- Series-parallel orientations preserving the cycle-radius (Q413267) (← links)
- Directed hypergraphs: introduction and fundamental algorithms -- a survey (Q507517) (← links)
- Approximate min-max theorems for Steiner rooted-orientations of graphs and hypergraphs (Q958684) (← links)
- The parity problem of polymatroids without double circuits (Q987548) (← links)
- A note on parity constrained orientations (Q987565) (← links)
- Old and new results on packing arborescences in directed hypergraphs (Q1744239) (← links)
- Packing of mixed hyperarborescences with flexible roots via matroid intersection (Q2048562) (← links)
- Decreasing minimization on M-convex sets: algorithms and applications (Q2089795) (← links)
- On some algorithmic aspects of hypergraphic matroids (Q2099466) (← links)
- Reachability in arborescence packings (Q2166224) (← links)
- Tree-compositions and orientations (Q2450662) (← links)
- Algorithms for finding a rooted \((k,1)\)-edge-connected orientation (Q2636819) (← links)
- A Survey on Covering Supermodular Functions (Q2971606) (← links)
- Steiner connectivity problems in hypergraphs (Q6072212) (← links)
- Fuzzy logic programs as hypergraphs. Termination results (Q6079415) (← links)
- Complexity of (arc)-connectivity problems involving arc-reversals or deorientations (Q6093584) (← links)
