The following pages link to Menger's theorem (Q2725048):
Displaying 23 items.
- A generalization of Menger's theorem (Q654247) (← links)
- Menger-type theorems with restrictions on path lengths (Q687118) (← links)
- A variation of Menger's theorem for long paths (Q796549) (← links)
- On a cycle through a specified linear forest of a graph (Q868359) (← links)
- A generalization of Tutte's theorem on Hamiltonian cycles in planar graphs (Q1044928) (← links)
- A mixed version of Menger's theorem (Q1180411) (← links)
- A generalization of Menger's theorem for certain unicyclic graphs (Q1205347) (← 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)
- On short cycles through prescribed vertices of a graph (Q1883253) (← links)
- On paths and cycles through specified vertices (Q1883258) (← links)
- Vertex-flames in countable rooted digraphs preserving an Erdős-Menger separation for each vertex (Q2300160) (← links)
- Graph-like continua, augmenting arcs, and Menger's theorem (Q2390152) (← links)
- Prescribed edges and forbidden edges for a cycle in a planar graph (Q2446300) (← links)
- On cycles through specified vertices (Q2495522) (← links)
- Disjoint paths in graphs. (Reprint) (Q2497998) (← links)
- A Mengerian theorem for paths of length at least three (Q3743329) (← links)
- A proof of Menger's Theorem by contraction (Q4786792) (← links)
- Menger's theorem for matroids (Q5530481) (← links)
- Defining binary phylogenetic trees using parsimony: new bounds (Q6069172) (← links)
- Minimum separators and Menger's theorem (Q6115429) (← links)
- Rooted minors and locally spanning subgraphs (Q6143382) (← links)
- The Lovász-Cherkassky theorem in infinite graphs (Q6658774) (← links)
