A Cantor-Bernstein Theorem for Paths in Graphs

DOI10.2307/27641867zbMath1132.05034OpenAlexW4237206978MaRDI QIDQ5440674

Carsten Thomassen, Reinhard Diestel

Publication date: 5 February 2008

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/27641867

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items (2)

The Lovász-Cherkassky theorem in countable graphs ⋮ Infinite gammoids

This page was built for publication: A Cantor-Bernstein Theorem for Paths in Graphs