Pages that link to "Item:Q1246433"
From MaRDI portal
The following pages link to Über die Maximalzahl kreuzungsfreier H-Wege (Q1246433):
Displayed 23 items.
- 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)
- Local topological toughness and local factors (Q2385135) (← links)
- Packing non-returning \(A\)-paths algorithmically (Q2476288) (← links)
- Disjoint \(A\)-paths in digraphs (Q2565693) (← 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)