The following pages link to On the orientation of graphs (Q1144041):
Displaying 28 items.
- Shattering, graph orientations, and connectivity (Q396883) (← links)
- The constructive characterization of \((k,l)\)-edge-connected digraphs (Q653995) (← links)
- Recent results on well-balanced orientations (Q955324) (← 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)
- On the \(k\)-orientability of random graphs (Q1024456) (← links)
- Generalized polymatroids and submodular flows (Q1116889) (← links)
- On orientations and shortest paths (Q1123899) (← links)
- A note on k-strongly connected orientations of an undirected graph (Q1161751) (← links)
- The ellipsoid method and its consequences in combinatorial optimization (Q1168215) (← links)
- Constructive characterizations for packing and covering with trees (Q1410688) (← links)
- On the orientation of graphs and hypergraphs (Q1410690) (← links)
- Combined connectivity augmentation and orientation problems (Q1410691) (← links)
- Base polyhedra and the linking property (Q1631626) (← links)
- Decreasing minimization on M-convex sets: background and structures (Q2089794) (← links)
- Decreasing minimization on M-convex sets: algorithms and applications (Q2089795) (← links)
- On the complexity of finding well-balanced orientations with upper bounds on the out-degrees (Q2106523) (← links)
- Orientations and detachments of graphs with prescribed degrees and connectivity (Q2339815) (← links)
- Degree complete graphs (Q2368928) (← links)
- Tree-compositions and orientations (Q2450662) (← links)
- The edge-orientation problem and some of its variants on weighted graphs (Q2509220) (← links)
- Algorithms for finding a rooted \((k,1)\)-edge-connected orientation (Q2636819) (← links)
- A Survey on Covering Supermodular Functions (Q2971606) (← links)
- Path Partitions, Cycle Covers and Integer Decomposition (Q3655152) (← links)
- Eulerian Orientations and Circulations (Q3697049) (← links)
- Approximating Minimum Cost Connectivity Orientation and Augmentation (Q4606698) (← links)
- On the existence of funneled orientations for classes of rooted phylogenetic networks (Q6652436) (← links)
