The Erdős-Menger conjecture for source/sink sets with disjoint closures
From MaRDI portal
Publication:707026
DOI10.1016/j.jctb.2004.08.004zbMath1059.05063OpenAlexW2027785237MaRDI QIDQ707026
Publication date: 9 February 2005
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2004.08.004
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Menger's theorem for graphs containing no infinite paths
- Sur une extension du théorème de Menger aux graphes infinis. (On an extension of Menger's theorem to infinite graphs)
- Menger's theorem for countable graphs
- The countable Erdős-Menger conjecture with ends
- Graph-theoretical versus topological ends of graphs.
- A General Criterion for the Existence of Transversals
- The Cycle Space of an Infinite Graph
- König's Duality Theorem for Infinite Bipartite Graphs
- Infinite graphs—A survey
This page was built for publication: The Erdős-Menger conjecture for source/sink sets with disjoint closures
