The following pages link to (Q4871749):
Displaying 38 items.
- Packing of rigid spanning subgraphs and spanning trees (Q401490) (← links)
- Strongly 2-connected orientations of graphs (Q473099) (← links)
- Orientations of graphs with prescribed weighted out-degrees (Q489364) (← links)
- Approximating directed weighted-degree constrained networks (Q627195) (← links)
- What is on his mind? (Q709300) (← links)
- Multiflows in symmetric digraphs (Q713317) (← links)
- On constructive characterizations of \((k,l)\)-sparse graphs (Q852713) (← links)
- On minimum power connectivity problems (Q972357) (← links)
- Rigidity, global rigidity, and graph decomposition (Q973100) (← links)
- Approximating minimum power covers of intersecting families and directed edge-connectivity problems (Q974743) (← links)
- Partial cubes: Structures, characterizations, and constructions (Q998441) (← links)
- Disjoint paths in symmetric digraphs (Q1003758) (← links)
- Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs (Q1045053) (← links)
- Optimal wavelength-routed multicasting (Q1392558) (← links)
- Constructive characterizations for packing and covering with trees (Q1410688) (← links)
- On one maximum multiflow problem and related metrics (Q1584451) (← links)
- Increasing digraph arc-connectivity by arc addition, reversal and complement (Q1613410) (← links)
- On orienting graphs for connectivity: Projective planes and Halin graphs (Q1758272) (← links)
- Disjoint paths in arborescences (Q1773369) (← links)
- Subgraphs decomposable into two trees and \(k\)-edge-connected subgraphs (Q1861573) (← links)
- The monadic second-order logic of graphs. XIV: Uniformly sparse graphs and edge set quantifica\-tions. (Q1874383) (← links)
- Strong connectivity of polyhedral complexes (Q1915156) (← links)
- Graph varieties in high dimension (Q1943338) (← links)
- Cyclic connectivity, edge-elimination, and the twisted Isaacs graphs (Q2131857) (← links)
- Eulerian orientations and vertex-connectivity (Q2217466) (← links)
- The lattice of cycles of an undirected graph (Q2228498) (← links)
- Extremal infinite graph theory (Q2275380) (← links)
- On Frank's conjecture on \(k\)-connected orientations (Q2284738) (← links)
- On Eulerian orientations of even-degree hypercubes (Q2294235) (← links)
- Chromatic characterization of biclique covers (Q2368922) (← links)
- A simple randomized scheme for constructing low-weight \(k\)-connected spanning subgraphs with applications to distributed algorithms (Q2456363) (← links)
- Short disjoint paths in locally connected graphs (Q2464055) (← links)
- Sparse certificates and removable cycles in \(l\)-mixed \(p\)-connected graphs (Q2488209) (← links)
- Simultaneous well-balanced orientations of graphs (Q2498739) (← links)
- On the existence of \(k\) edge-disjoint 2-connected spanning subgraphs (Q2573645) (← links)
- Approximating Directed Weighted-Degree Constrained Networks (Q3541798) (← links)
- Complexity of (arc)-connectivity problems involving arc-reversals or deorientations (Q6093584) (← links)
- The complexity of 2-vertex-connected orientation in mixed graphs (Q6108925) (← links)
