Pages that link to "Item:Q1410690"
From MaRDI portal
The following pages link to On the orientation of graphs and hypergraphs (Q1410690):
Displaying 47 items.
- On vertex independence number of uniform hypergraphs (Q399512) (← links)
- Resource-sharing systems and hypergraph colorings (Q411210) (← links)
- The complexity of two graph orientation problems (Q412352) (← links)
- Series-parallel orientations preserving the cycle-radius (Q413267) (← links)
- Directed hypergraphs: introduction and fundamental algorithms -- a survey (Q507517) (← links)
- Partial graph orientations and the Tutte polynomial (Q679543) (← links)
- On the most imbalanced orientation of a graph (Q721946) (← links)
- Approximate min-max theorems for Steiner rooted-orientations of graphs and hypergraphs (Q958684) (← links)
- On preserving full orientability of graphs (Q966169) (← links)
- The parity problem of polymatroids without double circuits (Q987548) (← links)
- A note on parity constrained orientations (Q987565) (← links)
- On mod \((2p+1)\)-orientations of graphs (Q1003841) (← links)
- A generalization of Sperner's theorem and an application to graph orientations (Q1026119) (← links)
- On reorienting graphs by pushing down maximal vertices. II (Q1406557) (← links)
- Old and new results on packing arborescences in directed hypergraphs (Q1744239) (← links)
- Orienting supersingular isogeny graphs (Q2025334) (← links)
- On the in-out-proper orientations of graphs (Q2043367) (← 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)
- A connection between Hadamard matrices, oriented hypergraphs and signed graphs (Q2361554) (← links)
- Orientation spectra of cubic graphs (Q2403682) (← 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)
- (Q3337493) (← links)
- (Q3342621) (← links)
- (Q3739143) (← links)
- Underlying properties of oriented graphs (Q3798680) (← links)
- (Q4396551) (← links)
- Graph Orientations and Linear Extensions (Q4595964) (← links)
- T-joins in strongly connected hypergraphs (Q4597952) (← links)
- Completing orientations of partially oriented graphs (Q4638628) (← links)
- (Q4953323) (← links)
- Even Orientations and Pfaffian graphs (Q5087677) (← links)
- On Mod $(2s+1)$-Orientations of Graphs (Q5246085) (← links)
- On the Structure of the Strong Orientations of a Graph (Q5285935) (← links)
- Orientability Thresholds for Random Hypergraphs (Q5364256) (← links)
- A new approach to the orientation of random hypergraphs (Q5743396) (← links)
- The complexity of arc-colorings for directed hypergraphs (Q5917590) (← links)
- A note on orientations of mixed graphs (Q5957358) (← links)
- Degree-constrained orientations of embedded graphs (Q5963649) (← 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)
- Matroid-rooted packing of arborescences (Q6646737) (← links)
