Pages that link to "Item:Q1246433"
From MaRDI portal
The following pages link to Über die Maximalzahl kreuzungsfreier H-Wege (Q1246433):
Displayed 47 items.
- Packing non-zero \(A\)-paths via matroid matching (Q317424) (← links)
- Graphs with large generalized (edge-)connectivity (Q339485) (← links)
- Tree metrics and edge-disjoint \(S\)-paths (Q463719) (← links)
- Packing cycles with modularity constraints (Q653988) (← links)
- On extremal graphs with at most \(\ell\) internally disjoint Steiner trees connecting any \(n-1\) vertices (Q897279) (← links)
- An algorithm for packing non-zero \(A\)-paths in group-labelled graphs (Q949790) (← links)
- Packing non-zero \(A\)-paths in an undirected model of group labeled graphs (Q965242) (← links)
- Cliques, minors and apex graphs (Q1043579) (← links)
- On the \(\ell\)-connectivity of a graph (Q1094432) (← links)
- Matroid matching and some applications (Q1144584) (← links)
- A minimax theorem for infinite graphs with ideal points (Q1196749) (← links)
- Über ein graphentheoretisches Problem von T. Gallai (Q1257027) (← links)
- Hadwiger's conjecture for \(K_ 6\)-free graphs (Q1311018) (← links)
- Minimax theorems for infinite graphs with the ends as ideal points (Q1331971) (← links)
- Maximum number of disjoint paths connecting specified terminals in a graph (Q1339394) (← links)
- Toughness and edge-toughness (Q1356703) (← links)
- Multiflows and disjoint paths of minimum total cost (Q1373749) (← links)
- On the graphic matroid parity problem (Q1400959) (← links)
- On the structure of \(k\)-connected graphs without \(K_{k}\)-minor (Q1767621) (← links)
- A generalization of Menger's theorem for certain block-cactus graphs (Q1805372) (← links)
- A short proof of Mader's \(\mathcal S\)-paths theorem (Q1850551) (← links)
- Half-integrality of node-capacitated multiflows and tree-shaped facility locations on trees (Q1942273) (← links)
- Disjoint non-balanced \(A\)-paths in biased graphs (Q2020032) (← links)
- Pfaffian pairs and parities: counting on linear matroid intersection and parity problems (Q2061881) (← links)
- Rooted topological minors on four vertices (Q2099413) (← links)
- Parameterized complexity of \((A,\ell)\)-path packing (Q2118381) (← links)
- Faster exact algorithms for some terminal set problems (Q2361353) (← links)
- Local topological toughness and local factors (Q2385135) (← links)
- Recent techniques and results on the Erdős-Pósa property (Q2403789) (← links)
- Packing non-returning \(A\)-paths algorithmically (Q2476288) (← links)
- Disjoint \(A\)-paths in digraphs (Q2565693) (← links)
- The Lovász-Cherkassky theorem in countable graphs (Q2680564) (← links)
- Optimal connectivity for fat-triangle linkages (Q2689492) (← links)
- Packing \(A\)-paths of length zero modulo a prime (Q2692782) (← links)
- Packing $A$-Paths in Group-Labelled Graphs via Linear Matroid Parity (Q2797090) (← links)
- Algebraic Algorithms for Linear Matroid Parity Problems (Q2799476) (← links)
- Length-constrained path-matchings in graphs (Q3150130) (← links)
- Packings and 2-packings of A-paths (Q3439371) (← links)
- Disjoint<i>T</i>-paths in tough graphs (Q3528155) (← links)
- Über ein graphentheoretisches Ergebnis von T. Gallai (Q4172084) (← links)
- Parameterized Complexity of $$(A,\ell )$$-Path Packing (Q5041178) (← links)
- (Q5136215) (← links)
- A Weighted Linear Matroid Parity Algorithm (Q5149751) (← links)
- Constructing Internally Disjoint Pendant Steiner Trees in Cartesian Product Networks (Q5374226) (← links)
- Pfaffian Pairs and Parities: Counting on Linear Matroid Intersection and Parity Problems (Q5866449) (← links)
- Node-Connectivity Terminal Backup, Separately Capacitated Multiflow, and Discrete Convexity (Q5883291) (← links)
- Finding Maximum Edge-Disjoint Paths Between Multiple Terminals (Q6057790) (← links)